Round 1BIn round 1B, I only managed to solve the first problem, Getting The Digits. It took me quite some time, but eventually I found the recommended approach to count letters that are specific to a single digit (e.g. Z occurs in no other digits than ZERO), then eliminate those digits; initially all the even digits have unique characters (0:Z, 2:W, 4:U, 6:X, 8:G), but after those have been eliminated, this holds for other digits as well: (1:O, 3:T, 5:F, 7:S) and finally (9:I). The program is ugly in that this sequence of letter/digit combinations is hard-coded; a good program would extract the letters by itself so that it could be ported more easily to other languages etc. My Lisp code is here.
Anyway, both of the other problems resisted my analysis. I should have been able to solve Close Match, but I couldn't decide whether it should be solved from left to right or right to left, and ended up spinning in circles. The final problem, Technobabble, is beyond my current capabilities: I neither succeeded in mapping the problem description to the correct graph problem (minimum edge cover on a bipartite graph), nor would I have been able to code an efficient solution to that problem. As an undergraduate I was good at these kinds of things, but lacked practice over the past 20 years or so.
With only one problem set solved, I ranked #4259 and was very far from qualifying. The other Lispers didn't fare much better in this round, except for orivej, who advanced by ranking #847. He or she only used Lisp for the first problem, and Python for the third.