Python, pasted on Dec 30:
 ```1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 ``` ```#Project Euler Problem 4 import time start = time.time() global bigO bigO = 0 n=999*999 pal=0 def is_pal(n): nstr = str(n) if nstr == nstr[::-1]: #print nstr + " is a palindrome." return 1 else: return 0 def has_3digit_factors(n): global bigO for i in range(999,100,-1): bigO += 1 if n % i == 0: if len(str(n/i)) == 3: #print str(n) + " is composed of two 3-digit factors: " + str(i) + ", " + str(n/i) return n return 0 while pal == 0: bigO += 1 if n%11 == 0 and is_pal(n): pal = has_3digit_factors(n) n -= 1 print "The largest palindromic number that is the product of two 3 digit numbers is: ",pal print "Iterations: ", bigO print "Total elapsed time: " + str((time.time()-start)*1000) + " milliseconds." ```

Output:
 ```1 2 3 ``` ```The largest palindromic number that is the product of two 3 digit numbers is: 906609 Iterations: 173209 Total elapsed time: 169.070005417 milliseconds. ```