def is_palindrome_number(n): return n == n[::-1]
largest_number = 0
for x in xrange(100, 999):
    for y in xrange(100, 999):
        v = x * y
        if v > largest_number:
            if is_palindrome_number(str(v)):
                largest_number = v
print largest_number

@@ -1,8 +1,20 @@
+import time%0A
 def is_p
@@ -54,16 +54,87 @@
 n%5B::-1%5D%0A
+%0Adef largest_palindrome_from_the_product_of_three_digit_numbers():%0A    
 largest_
@@ -144,16 +144,20 @@
 ber = 0%0A
+    
 for x in
@@ -175,24 +175,28 @@
 , 999):%0A    
+ 
+   
 for y in xra
@@ -218,16 +218,20 @@
         
+   
+ 
 v = x * 
@@ -232,16 +232,20 @@
 = x * y%0A
+    
         
@@ -279,16 +279,20 @@
         
+ 
+   
 if is_pa
@@ -328,24 +328,28 @@
             
+  
+  
 largest_numb
@@ -359,25 +359,299 @@
 = v%0A
-print largest_number
+    return largest_number%0A%0At1 = time.time()%0Alargest_palindrome_from_the_product_of_three_digit_numbers()%0At2 = time.time()%0Aprint %22largest_palindrome_from_the_product_of_three_digit_numbers: %25fs%22 %25 (t2 - t1)%0Aprint %22Answer: %7B0%7D%22.format(largest_palindrome_from_the_product_of_three_digit_numbers())
 %0A

Add timing for python implementation of problem 4