Leader of Birmingham.pm [pm.org] and a CPAN author [cpan.org]. Co-organised YAPC::Europe in 2006 and the 2009 QA Hackathon, responsible for the YAPC Conference Surveys [yapc-surveys.org] and the QA Hackathon [qa-hackathon.org] websites. Also the current caretaker for the CPAN Testers websites and data stores.
If you really want to find out more, buy me a Guinness
The initial script was based on upto 10 lines each per draw. Eliminating duplicates (numbers in lines and lines themselves) sometimes reduced to less than 10. There have been over 700 draws so far to work with, so not a bad amount of sample data. I'm trying some tweaks, but I still think you only win by not playing.
However, I think I won as I got to play with and understand pack() better and used The Guttman-Rosler Transform to speed up the sorting process. Now I just need to figure a quick way of calculating the number of unique characters in a given string.
Currently reading Dave Cross' Data Munging With Perl, which is proving a nice refresher to stuff I haven't done in a while.