No sense of humor.

Anyhow... In the interest of validating my fancy-pants (TM) algorithm I also wrote a "naive" one with which to compare results. The naive one simply increments the number by 1 and retests its palindromeness until it finally hits one.

The execution times are listed below.

To generate next palindrome for all numbers 1 to 150,000

naive method: 26.1 seconds

my method: 0.1 seconds

(Intel 3.2 GHz Xeon)

Maybe I'll post it if I know the contest is closed. Not sure how to tell from that hard-to-navigate site. It was torture just to find the palindrome problem again.

CodeChef - Problem PALIN