Al Zimmerman's programming contest is already off to a 50-way tie after just 2 days. Turns out the problem (Graceful Graphs) is easy if you recognize it as equivalent to the sparse ruler problem and apply Wichmann's formula. I ended up solving it in about 3 hours after seeing some hints on the mailing list and writing a small program. The only possibility that the top standings could change now is if it turns out that Luschny's conjecture is false by demonstrating a counterexample on the problem set in the next 3 months. It could happen, though. There isn't really a lot of strong evidence to support the conjecture.