0 Members and 1 Guest are viewing this topic.

Dapianokid said his took 11 seconds to compute the 42nd prime palindrome, but from the conversation, he may have a much more efficient algorithm for larger values. I think his was also running at 150MHz, so I am not sure.Has anybody set any benchmarks for other languages?

Lol I'm currently using the exact same algorithm as in BASIC and now it takes 4.5 secs to find the 1000th prime (15mhz Axe).

Although I don't see mention of it, the first post list all its examples in decimal. Judging by that, I'd say that they want the output in decimal format.