(!?) need fast algorithm for computing factorials

From: Adam Russell (REMOVE_THIS_adamrussell_at_sbcglobal.net)
Date: 11/07/03 

Date: Fri, 7 Nov 2003 10:49:39 -0800

I am looking for the fastest algorithm for computing factorials (ex:
4!=4*3*2*1). This is for a programming contest I am thinking of entering.
The program to be used is Labview and it needs to compute up to 10000!. I
realize that these numbers will be too large for simple representation, and
I think I can handle that. But I believe that simply multiplying each and
every number probably is not the most efficient algorithm so would like
advice on any numeric methods that might be quicker.