KACTL ModMul. It says that it runs around 2x faster than naive
(__int128_t)a * b % M
When I ran my benchmarks with -O2, the results were similar. Am I mistaken?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
KACTL ModMul. It says that it runs around 2x faster than naive
(__int128_t)a * b % M
When I ran my benchmarks with -O2, the results were similar. Am I mistaken?
Name |
---|
This is only one mod operation, try doing more operations and benchmarking.
I did that. I did 1e5 runs and their running time was basically the same.
1e5 operations is not very many. That should take around 1 millisecond. Try something like 1e10 of them to spot a consistent difference. Also make sure the compiler can't optimize it out.