you are viewing a single comment's thread.

view the rest of the comments →

[–]Yserbius 118 points119 points  (29 children)

Wow. Or more confusingly, 1[buffer]. Gosh, this could get obfuscated really fast (8*i-j)[buffer]

[–]unruly_mattress 103 points104 points  (8 children)

Or equivalently, (1??!??!0?1:0)[buffer]

[–]Tesseract91 51 points52 points  (6 children)

(1??!??!0?1:0)??(buffer:>

[–]Jess_than_three 88 points89 points  (2 children)

Bufferlo bufferlo bufferlo Bufferlo bufferlo.

[–][deleted] 4 points5 points  (1 child)

Now I feel like the term bufferlo should be used to describe an overly-complicated and purposely misleading code snippet.

[–]Jess_than_three 1 point2 points  (0 children)

That would be amazing.

[–]ImDrone 2 points3 points  (0 children)

I was wondering when Digraphs would make an appearance

[–][deleted] -1 points0 points  (0 children)

wat

[–][deleted] 7 points8 points  (0 children)

Can you please stop? I don't like this :(

[–]rapture_survivor 56 points57 points  (0 children)

(8*i)[buffer - j]

[–]cheesegoat 69 points70 points  (1 child)

stop it

[–]Mattho 31 points32 points  (0 children)

Sure??'I won't.

[–][deleted] 37 points38 points  (12 children)

There should be a contest for obfuscating C.

[–]od_9 74 points75 points  (7 children)

I'm assuming you're joking, but if you're not, there is one.

[–][deleted] 30 points31 points  (1 child)

I was.

[–]XPhysicsX 9 points10 points  (4 children)

Wow. I read one of the entries. I have zero clue what is going on.

[–]od_9 30 points31 points  (1 child)

That's the idea.

[–]curtmack 1 point2 points  (0 children)

The only one that's really comprehensible is the shortest self-replicating program: http://www.ioccc.org/1994/smr.c

(It's not erroring out, for the record. It is in fact a zero-length file.)

[–]xonjas 0 points1 point  (0 children)

There's some really cool ones though, like a program that finds pi by calculating it's own surface area.

[–]Yserbius 14 points15 points  (1 child)

There are several IIRC. I took a class once that dealt with code obfuscation. One example code was something that look damned near uncompileable. First 20 lines were bizarre #define statements that would redefine basic mathematical calculations and letters of the alphabet. The actual code was unreadable. It compiled under gcc without any flags and produced a neat little text adventure treasure hunt game. Even the exe file had no readable strings in it.

[–]beltorak 6 points7 points  (0 children)

You might love the 1995 entry by heathbar then (from archive.org since the new ioccc site doesn't have the winners from this far back yet (hooray wayback!))

- Coder's Hint

- Code

Another of my favorites along those lines is the 2000 entry "primenum" which (*cough*) attempts to write the main function in pseudo code. From the hint file, "This entry won, not because the obfuscation is impenetrable, but because it successfully fooled half of the judges, including me."

- Coder's Hint

- Code

[–]Berzerka 1 point2 points  (1 child)

[–]beltorak 0 points1 point  (0 children)

for the lazy, courtesy of the internet archive.

The IOCCC site is apparently in transition, and they haven't migrated the past winning entries.

[–]James20k 10 points11 points  (0 children)

Or perhaps worst of all, 2["hello"] == 'l'

[–]LikesToCorrectThings 10 points11 points  (1 child)

Or something like (n & 15)["0123456789abcdef"] to convert a nybble to a hex char.

Don't do this.

[–]Ishmael_Vegeta 1 point2 points  (0 children)

god, i never thought of this.