Skip to content(if available)orjump to list(if available)

Finding a billion factorials in 60 ms with SIMD

Finding a billion factorials in 60 ms with SIMD

1 comments

·June 22, 2025
Visit

few

It's interesting to see which codeforces blog posts get traction on HN.

For context, in competitive programming a lot of combinatorial problems (find some formula to count something) require you to output the answer modulo some prime. This is because otherwise the answer would overflow an int and make the problem too tedious to be fun and too hard for problem setters to write good problems or checkers for.

So to prove that you still know how to count the thing, you can do it a finite field. If you use integers mod prime, you still have all the usual arithmetic operations like addition subtraction multiplication. And even division is still easy since you can calculate multiplicative inverse with Fermat's Little Theorem (a^(p-2) = a^(-1) mod p). The final answer you output is not the real thing you're counting, but just evidence that you had the right formula and did all the right operations.

Anyway, just wanted to give context for why competitive programmers care about factorial mod a prime (usually as part of a binomial or multinomial expression). And I'm kind of surprised anyone outside of competitive programming cares about it.

See also:

https://usaco.guide/gold/modular?lang=cpp

https://usaco.guide/gold/combo?lang=cpp