3 ms·

Grover's algorithm provides a quadratic speedup, but sqrt(n!) is not quadratic time; it's super-exponential.