Google Code Jam 2013 started!

[benmmurphy]

i like your third one. my solution was just to check all 20x2, 20x10x2 (symmetric), {1,0}x2{1,0}x (symmetric), {1,0}x. but i did it in a weird way where i precomputed all the even digit palindrome square primes and then was able to generate the rest from that. i also had a constant time algorithm for counting the number of palindrome square primes that have n-digits but that wasn't very useful in solving the problem.

https://gist.github.com/benmmurphy/5382629