The Lounge is rated PG. If you're about to post something you wouldn't want your
kid sister to read then don't post it. No flame wars, no abusive conduct, no programming
questions and please don't post ads.
Looking at ProjectEuler and the OEIS website, it seems that some programming languages offer shorter methods of doing something (mathematical) (and I'm not just talking about the obfuscatory syntax). One language that comes to mind is J; another is Maple. It seems that you can do a lot with just a few short calls. Why isn't that added to most languages? Is there a repository that adds the most optimal method to do something into a library for that language so that it may be used?
What is the longest running program? I assume the programs developed for Voyager 1 and 2 are pretty much up there. What other types are there? Is there a never-ending program that is calculating all the primes and storing them in a library somewhere?