I got 10,067,892,461 = 9,910,110,199 + 144,959,441 + 12,822,821, which I think is pretty impressive.

Ah that is neat. For most smaller numbers, it seems to use 0 a lot, which is not interesting. But your example is the first one I saw that didn't include 0.

It uses 0 a lot because you're giving it such easy numbers that it only needs to solve them as the sum of two palindromes.

Try 2165749873212654987321354.

The impressive thing is actually the underlying proof. 40+ pages with lots of edge cases and algorithms for every scenario of any arbitrarily large number.

OK tough guy, please give me three palindromic numbers that add up to 1,234,567. And don't use the trick! And don't use brute force!

1234321 + 242 + 4

1,234,567 + 0 + 0 = 1,234,567

> > OK tough guy, please give me three palindromic numbers that add up to 1,234,567. And don't use the trick! And don't use brute force!

> 1,234,567 + 0 + 0 = 1,234,567

The first of these is not a palindrome.