What are the better methods (algorithms) to computing the first number (or few leading numbers) of a large factorial.
Wolfram alpha seems pretty fast and handles large numbers. Is it accurate? Does it follow Find the first digit of a number approach?
I am not sure with the method Wolfram Alpha is using. But if you want to approximate big factorials, you might use the method you linked. It works fairly well if you use a sufficient amount of bits to represent floating point numbers (which I think, Wolframalpha has fair accuracy. Also not sure exact numbers on this).
Instead of just multiplication of lots of numbers, for factorials, you have Stirling approximation. (The logic behind this is same with what you linked) This can approximate value of $n!$ with quite nice accuracy. However, the usual "Stirling approximation formula" is not convergent (it means, it can have some big error for evaluating very big numbers), hence I suggest using it's variation which is proved to be convergent. You can see the formula here. https://en.wikipedia.org/wiki/Stirling%27s_approximation, under section "A convergent version of Stirling's Formula". It also lists some versions better for computations.