
Quickly calculate \$ n! \bmod p \$ fastest-codefactorial
The idea is extremely simple: Given two positive integers \$ n \$ and \$ p \$, calculate the result of \$ n! \bmod p \$, where \$ p \$ is a prime.
Scoring
Your score is the highest \$ p \$ you can achieve within \$ 10 \$ seconds, by runn...