It's surprising how few people are active on all three of Stack Overflow, Server Fault and Super User. Well, maybe not so surprising. But it's a big world; you'd think there'd be more.
In any case, Stackathlon is intended to foster a little friendly, fun competition. Perhaps while wearing a little more clothing than the ancient pentathletes did. But who cares just as long as my web cam is turned off?
The icons indicate the level of reputation points achieved in each site. A laurel wreath means at least 10,000 points. Three, two and one leaves represent the 3,000, 2,000 and 1,000 point levels. The list is sorted by the levels and sub-sorted by total rep points.
The code is closed license for the time being for the safety of the general public.
You can see the most recent update of the list at stackathlon.appspot.com
The app uses the Google App Engine (the migration to that platform is in progress).
Stackathlon is a product of Dennis Williamson. I take full responsibility for any unpleasant aftertaste. I can be reached at [my first name] [that circled a] [netstrata] [dot] [oh, what's that last part? oh, yeah, "com"].
The app is written in Python. The code is very delicate and rough. Like broken porcelain, but without the pretty pattern. It causes the CPU* to emit a noise not unlike fingernails on a chalkboard. Code is Poetry. Some code is Vogon Poetry.
* No, really, I do mean the actual chip.
The graphics were done by me using Inkscape and Corel Paint Shop Pro. The font is Dalek.
Yes, I know there's a typo in the screen shot. It's part of its charm, don't you think?
As it stands now, the primary sort is by "laurel levels" and the secondary sort is by total rep (then name if it gets that far). I could change this to insert a sort by nearness to the next "level" before the total rep sort. For example let's say two people each had a wreath, a two-leaf and and a one-leaf. Person A has the lower total rep, but is closer to moving to wreath/three-leaf/one-leaf than Person B is to moving either two to three or one to two. With a modified sort, A would be higher in the ranking within his level. A is likely to move above B anyway if the trend continues. Which sort method do you think is better and why? (Disclosure: I hesitate to do this because it would put me at the top which is not the intended purpose.)
In honor of me being the first to achieve three-wreath status, I have gone ahead and updated the code to sort by nearness to moving up a level.
[sounds of horns self-tooted]