Wow, the TPR(0,4c) has started very strong. I've checked for about 50 solutions today in five hours. There are some amazingly clever solutions.
There are two holes in this tournament: finding the rightmost non-zero digit of a factorial, and computing the postorder, given the preorder and inorder of a binary tree. Best solutions right now use 48 and 50 keystrokes respectively.
Thanks goodness for -MO=Deparse.