I've been hanging around on Code Golf Stack Exchange a lot, posting often in TI-BASIC, which is surprisingly good at code golf in simple math challenges and such. However, something that TI-BASIC isn't good at is string manipulation. Empty strings error when you try to do anything with them, inString( and sub( are clunky and slow, etc. But they can be interesting to optimize for size.
Therefore, I have posted a massive 600-point bounty on this challenge to see who can best optimize TI-BASIC string manipulation programs. To put that in perspective, 600 reputation points typically takes me about three weeks of constant posting to earn.
To submit your answer, make a SE account if you don't already have one, and post it in spoilers as an answer to the question. If you have the smallest sum of sizes of your solutions to the twelve challenges, I'll award you 200 (in 3 days) and then another 400 if you're still winning in 10 days.[/url]
Therefore, I have posted a massive 600-point bounty on this challenge to see who can best optimize TI-BASIC string manipulation programs. To put that in perspective, 600 reputation points typically takes me about three weeks of constant posting to earn.
To submit your answer, make a SE account if you don't already have one, and post it in spoilers as an answer to the question. If you have the smallest sum of sizes of your solutions to the twelve challenges, I'll award you 200 (in 3 days) and then another 400 if you're still winning in 10 days.[/url]