hacker.org

I have to say that I've done everything by hand.. getting source, downloading zip, finding .class, decompiling .class, and finally I still have to convert the answer into decimal...My decompiler automatically use a hex form..

I just analyze the code a litttle bit, and the divide the output into groups with 6 number in a group, like this: 2632 2718 2662 2937 557 3026 2968 3003 549 2936 2706 2726 2732 562 2941 2690 2706 2984 569 3005 2710 2937 2713 2738 2963 562 2957 2685 2706 577 2732 2711 2998 529 2718 2985 2976 2711 294...

I have to say that this challenge is very, very similar to another challenge in hacker.org...

Not a very hard cipher, indeed. Every step is quite obvious. I wonder why so few people solved it. And also, I suggest to change the answer to a string that is not an English word. Otherwise solvers don't even need to work on the transposition cipher part. They only need to find what is the appended...

mine: 0@s!@ @@@ @ 01^gP1+$ And, it seems that printing some more \0 will result in 'incorrect', but the return message will not contain those \0 in the tail. So I gets something like: <font color=red>Expected: '0@s!@@@@@@ x01vgP1+$', got: '0@s!@@@@@@ x01vgP1+$'</font><br> Your King of the Hill score...

Very interesting challenge. At first I do some fixing work for the obscured decompile code to make it clearer. And then I suddenly realize ( actually, guess ) that a(String, String, boolean) is a HVM interpreter when I see the long ( and broken ) switch list. Luckily this is correct. By the way, HVM...

After base64 and turn 6 to g,4 to h, I googled several starting steps and found nothing. Then I tried searching some ending steps and got the answer in http://docs.google.com/viewer?a=v&q=cache:1PTYahR0XG4J:www.chesshouse.com/v/vspfiles/pdf/novag-turquoise-chess-computer-manual.pdf+&hl=zh-CN...