[Project Euler Problem 4]Largest palindrome product

def ispalindrome(x):
    return str(x) == str(x)[::-1]

for i in range(100, 1000):
    for j in range(100, 1000):
        r = i*j
        if ispalindrome(r) and r>result:
            result = r
print result

.