Some friends and I used to hold a hybrid drinking/Project Euler contest. You would have hated our solutions. I remember winning on the back of nine nested for-loops and, on a separate occasion, doing a primality check using a literal array containing the first 80,000 primes.

That's what happens when time-to-solution is what you optimize for. I'm sure it's familiar to startup programmers :).