I've written and rewritten a palindrome finder in TI BASIC. I found one online, but it isn't very good. I don't know how to manipulate lists well enough that I can input a number larger than 14 digits and it be checked properly... Plus it is very slow.
Writing one in ASM seems impossible to me.
Axe doesn't support big integers..
So I'm asking everybody to rewrite the only palindrome finder online at Ticalc to make the best one they can find, or write their own.
This is more of a challenge than anything
Altho it would be really helpful, as I am trying to learn about math using programming

Since this is highly conflicting as the TI-Planet contest going on right now, I guess anyone who wants to do this would like to participate to the contest (and not publish stuff before the end)

We'll very soon translate the contest rules/topic

http://tiplanet.org/forum/viewtopic.php?f=43&t=11479

Wow I feel pretty ninja'd right now *wipes tear* spare me oh ninja clan

I wrote three different programs to do it with three different data types.

If I knew french, I would!
Mine is fast, it does the number 69 in about three seconds, and I have one that does lists of sizes up to 998, and strings up to the amount of RAM you have.