Obfuscated Coding Contest

[Martin]

200 bits for this one.

What your program has to do is output "Hello World" to the screen. There's a catch though: your goal is to make your code as confusing and difficult to read as possible.

Only rule is that your code must be indented properly.

Your program must finish executing within 5 seconds of loading up.

Go!

[Tony]

brainfuck:

++++++++[>+++++++++<-]>.<++++[>+++++++<-]>+.<++[>+++<-]>+..+++.++++[>++++++++<-]>.<+++++[>++++++++++<-]>+++++.<<.+++.------.<+++[>---<-]>+.

[rizzix]

that is not obfuscated tony.. its just bf.

[Martin]

One of the languages that is supported by this site, or that wtd has written a tutorial for only.

[Tony]

*Opens up adminPanel and adds brainfuck to the list of forums*

[Martin]

Fine. -1000 bits for plagerizing.

[Brightguy]

VisualBASIC:

Sub Form_Load()     Dim a(0 To 10)     a(0) = 29492     a(1) = -42248461/504     a(2) = 4881462049/50400     a(3) = -2761745939/45360     a(4) = 8480639179/362880     a(5) = -99877913/17280     a(6) = 20304973/21600     a(7) = -6042593/60480     a(8) = 807637/120960     a(9) = -92357/362880     a(10) = 3827/907200     For b = 1 To 11         c = 0         For d = 0 To 10             c = c + a(d) * (b ^ d)         Next         Print Chr(c);     Next End Sub

If you can't see the output make sure the form's AutoRedraw is True.

[rizzix]

k, beat this:

Perl:

#!/usr/bin/perl for (($______ = "M") =~ tr/J-M/A-E/,$_____ = '\\'.$______.'+',        ($____ = qw(s/$1/ord("h")/goix||s{$1$5}(($1|$1).?\D+[$7,0,9,$8]?as)xo&)               . qw(&s/$1[:]*/$2.*[$3]?/xgo||m($1?\P{$1$2}.*[$1,$1,$4]+)||s/$1)               . qw([0-5]?.*($1$1[0,1]$1$6)/0?.$3$2+\s+$1$1$5/goi&&s/[1,0,4]?$1[)               . qw(0-5]?/$[1,0,2]\D+$1$1$6/&&m[$1$2$5]ix))               =~ s*($_____)**go, $__ = 0, $k = "", $___ = 3;     $__ < 6*8; $__ += $___) {         ($k .= chr(int(substr($____, $__, $___)))) and         (length($k) == 16-1 ? eval("*_ = ".$k."}") ? eval('$_ = "oLSSV wVYSK\n"'):false:false) } tr/H-Za-r/a-zA-Z/; _ ($_);

[zylum]

rizzix wrote:

k, beat this:

Perl:

#!/usr/bin/perl for (($______ = "M") =~ tr/J-M/A-E/,$_____ = '\\'.$______.'+',        ($____ = qw(s/$1/ord("h")/goix||s{$1$5}(($1|$1).?\D+[$7,0,9,$8]?as)xo&)               . qw(&s/$1[:]*/$2.*[$3]?/xgo||m($1?\P{$1$2}.*[$1,$1,$4]+)||s/$1)               . qw([0-5]?.*($1$1[0,1]$1$6)/0?.$3$2+\s+$1$1$5/goi&&s/[1,0,4]?$1[)               . qw(0-5]?/$[1,0,2]\D+$1$1$6/&&m[$1$2$5]ix))               =~ s*($_____)**go, $__ = 0, $k = "", $___ = 3;     $__ < 6*8; $__ += $___) {         ($k .= chr(int(substr($____, $__, $___)))) and         (length($k) == 16-1 ? eval("*_ = ".$k."}") ? eval('$_ = "oLSSV wVYSK\n"'):false:false) } tr/H-Za-r/a-zA-Z/; _ ($_);

lmfao

[bugzpodder]

at least mine is original

c:

see version two below

[rizzix]

yea so is mine

nice one btw.

[Martin]

Can anyone beat these...?

The race is on. Contest closes Sunday.

[bugzpodder]

version two:

c:

#include<stdio.h> #define B int #define I main #define T () #define S { #define T1 ( #define ME T1 #define T2 ) #define Z } #define s ; #define b 0 #define BO return #define lunch putchar B I T S for ME B i s i["]<i;++i){--i;}"] s i++ T2 lunch T1 i ["\x48\105\x4C\114\117 W\x4FR\x4C\104!\n"] T2 s BO b s Z

[bugzpodder]

is there a judging criteria? messy/code length/etc

[rizzix]

yea good question.. although keep in mind martin, obfuscation is really vague.. it covers horrifyingly messy code to beautifully decorated code.. but one thing is for sure: the code should break standard coding conventions and they do tend to make decyphering difficult.

edit: i suggest looking at international obfucated coding contests.. they give a better picture.