I can see the gulf between theoretical computer science and algorithm hacking as
1. the first is all about the purity of form, the algorithm has to be expressed as succinctly as possible(lambda calculus, function combinators)
2. the second is all about the purity of essence, stripping the code from internal cruft and removing inefficiency, the algorithm external look is irrelevant.