Slashdot Mirror
5th Annual Obfuscated Perl Contest
$Bob writes "The best and brightest of the Perl community are showing up to drive you insane. Test you strength in the 5th Annual Obfuscated Perl Contest!" Name your variables after the stooges! Write Spagetti! Its good!
Click and scroll down
How about a writing Perl-obfuscator in obfucsated perl? Then, just crank your code through enough times that even you can't recognize it, and submit!
(Well, actually, it was the regex that put him off... Any language where| ([^\s]+)\s?|\s/g) {
while ($line=<>) {
foreach ($line=~/\"((?:(?:[^\"\\]*)|(?:(?:\\\")*))*)\"\s?
print "$_\n";
}
} is legal is enough to scare anyone...)
(One faux karma point to anyone who can tell me what that does :))
You are in a maze of twisty little relative jumps, all alike.
How many of you were sitting at work when you saw this item, and have since spent a good deal of time trying to write a bit of obfuscated perl to post here as your response?
I'm not the only one, fess up.
Wouldn't the real challenge be an UnObfuscated Perl contest?
;)
(disclaimer: I like and use perl for many things...but it still looks like a doctor's handwriting
-- Life is short. Forgive quickly. Kiss slowly. ~ Robert Doisneau
What made it obfuscated?
- It didn't use Xlib. It opened a socket and wrote the X protocol directly.
- It was about 1024 characters long.
- It ran like a bat out of hell - each pixel was a cell (so typical workstation monitor == one million cells), and it appeared to do about five or ten generations a second!
I loved just leaving that puppy running.... It started out with a random sampling of cells, and watching gliders spring up and soar across the screen....ObPerl: And people have suggested using this language as a first programming language? Eep.
-----
Klactovedestene!
cat
I've finally had it: until slashdot gets article moderation, I am not coming back.
Why don't you enter slash??
I know deep down you've always wanted to. <grin>
Of the Obfuscated C Code Contest.
That contest could create some real good compiler tests.
Like, how about a solution to Towers of Hanoi that let the compiler solve the problem by recursively including itself, eventually creating one huge 'printf()'-statement?
And it used a compiler switch for the number of pegs. At the time I tested it, gcc broke (or my computer ran out of memory, I'm not really sure which of the two...) at 15 pegs.
The solution to 14 pegs would create a over 1 MB executable containing just an MB of printf("really long string"); text.
If I find a link to it somewhere I'll let you know. The International Obfuscated C Code Contest (IOCCC) has it's homepage at www.ioccc.org, but I can't seem to remember the name of the program.
Every expression is true, for a given value of 'true'
Check out the C obfuscated contest from the 90's. If you haven't seen any of the winning programs before, you will be amazed, shocked and left in wonder (Like I wonder what the day job of these developers is...)
International Obfuscated C page and the amazing and confounding winners.
My favorite is the tic tac toe game that is both the game and the code! (recompile to play next move...)
-- Moondog