Do it now!

import sys

import time

def Factorial(N):

    checkSize = 5000

    endN = N / checkSize

    facResult = 1

    for fi in range(1, endN + 1):

        facResult = facResult * reduce(lambda x, y : x * y, range((fi-1)*checkSize+1,fi * checkSize+1))

    if ( (endN * checkSize + 1) != (N+1) ):    

        facResult = facResult * reduce(lambda x, y : x * y, range(endN * checkSize + 1, N+1))   

    return facResult

number = 100000

startTime = time.time()

factorialN = Factorial(number)

print "runtime is %s"%(time.time() - startTime) 

#print "Factorial %d is %d"%(number, factorialN)

tempResult = [0, 1, 1];

def fibonacci (number):

   if ( number == 1 or number == 2):

      return 1

   if ( tempResult[number] == -1 ): 

      result = fibonacci ( number-1 ) + fibonacci ( number-2 )

      tempResult[number] = result

   return tempResult[number]

for idx in range(3,1001):

    tempResult.insert(idx, -1)   

for idx in range(1,1001):

    print idx," : ",fibonacci(idx)

def fibonacci2 (number):

   if ( number == 1 or number == 2):

      return 1

   previous =  1

   result   =  1

   sum      =  0

   for i in range(3, number+1):

       sum = result + previous

       previous = result

       result = sum

       print i," : ",result

   return result

fibonacci2(1000)