hacker.org

Very nice challenge indeed!

The title made it kind of easy, though, thanks

Probably the worst one yet (in this thread as well as for me personally): 8888888******20>0s/,12^>1+\ /v1[1^\ /\? -*82x/ 1 0 \s/0110<s/12^<x20<-?s\0^2^:=\ 1 P /1v/ 1 1 1 > * /\?=-*82x+1v1[=s/s==s/s/s=0/ 4 \1[p20<12\ \+92/s?x-1>v/ ! The uglyness of the eights is because i realized I was sorting in th...

I got the cil code, too, it was really quite fun to learn the instruction set (or part of it) by just looking at the code. The loop in the Main function was helpful because I already knew what it was supposed to do and once I understood that the rest wasn't all that hard.

After that I used imagemagick to beef the contrast of the frames up a bit and had them shown to me in 8-column rows (to confirm they could be ascii). Then I just typed them all in by hand, it wasn't really worth figuring out how to automate that.

You almost had me look up all the possible yoga moves and try to get a hidden message from that until I noticed that little flicker at the edge of the screen

I loved the part where you ended up with a hackvm program… And I instantly recognized it as such

i'd love to see a challenge where you had to enter the source port number you used to connect to hacker.org Especially challenging if you're behind a NAT.

I guess one could also just quicksort and then scan for duplicates. That's what I'd have done if I wasn't too lazy. I didn't even do linear probing (might have done, but my lazy test modulus of 9999*** just worked on my first try).

Not having been spoiled before I probably submitted the ugliest ever answer with 5517 instructions (no spaces) and a limit to numbers ≤ 250… It works as follows: fill the stack with 250 zeroes and 250 ones, then read the first value and backup it to a new memory slot n. Now, 250 times, copy the nth ...

EDIT: removed because it sort of solves the follow-up challenge, broken keys (didn't know it existed, sorry)

Without this thread i'd have expected the answer to be something that can be represented exactly as a decimal, thanks for the help on this somewhat “dirty” challenge.

I had to resort to (almost) pure guessing… audacity provides a nice little spectrum analizer that even gives you the musical notes of the peaks if you toy around with it for a bit (a lograrithmic x axis works wonders), but I have no clue where to find the second letter in the answer in the three-dig...

The hostname and protocol are case insensitive, but the username, password, path and query are up to the server to interpret, and if that server's OS has case sensitive filenames (which is the case for most currently used non-MS-windows operating systems) the case is likely to matter.

If you pick up a Crusher it says “looks sharp” instead of “yeah!”… maybe it's the best sword, then.

/me just wasted half an hour with a note→frequency table, audiacity's zoom tool and ruler and a calculator… Especially frustrating if you repeatedly get frequencies that are excactly between notes.

Gotta admire the human ear for dealing with this mess (if properly trained)