hacker.org

Hello, I've had the same problem since a week or two. The svg version of the map appears messed up too, I don't know if there is a link. I suppose the bandwith and CPU capacity of the server are already pretty huge. Maybe some users are trying to solve the Cave Master problem without any delay betwe...

Hello,

For the injection, I used , with 1 as password.

And there's a way to get the source of the page, I don't know if it's intended.

And a lot of apocryphal versions. But Shakespeare is more user-friendly.

Hello, I suppose Math.abs(x) returns -x if x is negative and x otherwise. In two's complement, -x is the same as ~x+1 (inverse all the bits of x and add 1). But -2^31 is represented by 0x80000000; it stays the same when you apply the algorithm, as 0 does. So --2^31 is still -2^31. And as gfoot said,...

Well, that was a nice challenge! Interesting combination of data analysis and programming ideas. In the end I certainly spent more time on it than if I had done it manually, but that's not really the point. I used a simple approach. First repaint the image in three colors. I decided that a pixel was...

I didn't know about the 1 hour penalty, I based my estimations on 30s/try. And there is a slightly better 19 solution (roughly (7/40)**5), with a "nop" instruction that I don't know how to drop or use. Thanks for confirming that this is the expected solution. After all, it's less intensive...

I found the same too.

Out of curiosity, teebee, what is the success rate of your 19 instructions mouse?
I have one that could theoretically pass the tests once in two days, but I'm a bit reluctant about poundering the server.
could also work about once a month...

Amazing puzzle! My first idea was to use numeric representation, pushing digits on the stack and converting them into ascii chars. This is pseudo-base-9: 10574819781600317848486744@s!@@@@@ 9*+84*+P$ Obviously this method couldn't satisfy the 29-char constraint. It took me some time to realize that t...