hacker.org

Could it look any different? I'd like to see your solutions please (i bet there can't be a very small of this, so it's save)

I have the same solution as m!nus!

again! *checks for keyloggers* -- oh wait, last time you had it before me

now i only have fast strrev and sorting left, the hardest ones :/
both will maybe work with threading :/

That would be identical to mine too! Any variants?

I tried a different method. I managed to print "Hello, World" using 29 instructions.
Only one char is missing !

Ufffff...

I finally got it. And I did it in 2 lines of code!

Thanks for your sharings - sometimes THE one idea to solve something (in 1 line) doesn't
come to ones mind...

Here is my solution: The characters between / and \ in the first line are the "Hello, World!" characters +128.

I needed 3 days to find the tricky 4] solution

By the way... I would like to see more discussions about different solutions in the solved section.
Okay, we have to be carefull about future challenges.
But I use this site to learn something and not to be on top of the list (, if so I had to hide my solution).

What do you think?

Best regards,
Yharaskrik

Hey, efe!

Did my solution help you to shorten your solution?

When I saw that I cannot see my own posting in the forum
(I really don't like these "King of the Hill" challenges )
I had to start working again...

Yharaskrik, in fact, your clever solution helped me shortening the 1-liner ! Thank you!

Here is my solution:

This is one of my solutions. There is an invisible char in the code so that the size is 30

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: Obviously this method couldn't satisfy the 29-char constraint.
It took me some time to realize that the data could be embedded in the code and find the 32 chars solution that m!nus posted.

Seeking further, I tried to alternate the instructions and the data chars, as arthur did, unfortunately loosing control on the loop. This one has 29 chars but it loops 16 times and so prints 3 extra trailing null bytes: Working again on the 'easy' solution, I could go down to 30 with the MSB trick by dropping the '%' and taking advantage of the ',': and finally I found how to drop the useless space that was bothering me since the beginning:

9@s!@@@@@Hello, Worlä¡1^gP1+$

Probably the unique solution, modulo trivial modifications (unless someone finds a voodoo thread-trick).

Yes, I got the same at the end.

harvestsnow wrote:

Code: Select all

9@s!@@@@@Hello, Worlä¡1^gP1+$

I got following 30 chars solutions ... in order of finding: Grrr ... it would be so easy if one would read the state of the thread at the time it was on 30... with optimal layout already mentioned ...

arthur wrote:This is one of my solutions.

Code: Select all

0@H@e@l@l2o+,1 ^Wgo8r1l^d?!P.$

(asc(.)<9)

This solution was very close to mine ... using all working characters of the result.