there's only 1 vimgolf.com challenge where hardware limitations become a problem, and i made it (my mistake). fastest way to sort by the sum of a list of numbers was to indent the line sum times. millions and millions of tabs
probably been discussed here before, but i actually have a solution on this that's 2 strokes shorter, but the memory/cpu involved make it impossible to run, though there's no reason the result would be wrong if you could. i can mention it in the write-up, but what would my "listed" byte count be?
and the spirit of my "criticism" is more like "lol, that was something". it actually turned out interesting, because the large number forced me to invent a new tactic to avoid typing all the digits
i just got done testing a vim macro to isolate all primes under 1,000,000. took 10-15 minutes. and this is the fast implementation. though the last digit did force an interesting trick i guess...
@DJMcMayhem that's practically vimgolf.com style. i could do that. (only difference is you've gotta increment the array size dynamically, but that's not so bad)
don't suppose there's any precedent for an ex answer :D working on the quine thing a few days ago, did that in 14. but if you have to use : from vim it grows a bit (and the eof newline definitions get even hairier)
vimgolf.com has kind of a split community. there are tons of people who do a challenge or 2, but at any one time maybe a couple dozen active users who do a lot of them
hard to say without actual expertise, but i wonder how high the quality of answers in other languages is, or how easy it is to tell if you've got a perfect score