Weirdest obfuscated "Hello World!"

  • Task:



    Create an obfuscated program that prints Hello World! (exactly like that). Your program may not have any strings in it.



    Rules:




    • You can use any programming language you like.

    • Make it as obfuscated as possible

    • This is a , so the answer with the most upvotes wins.






    Note:



    This is not a duplicate of this question. That one was and it had different rules.


    Who is the first to submit BF? `:)`

    @VisioN - I would consider BF not really obfuscated...

    Do you consider a single char as a string?

    @ProgramFOX - no

    "That one was tag:code-golf. The rules do seem to exclude copying the answers from the older question, but principally because they exclude all answers: there's no program which can't be obfuscated more.

    I disagree that they are duplicates, on different grounds than simply "The other one was a code-golf". The code-golf one required that a specific subset of characters never be used in the source code, whether it be in a string or not. There should be no matches in any of those entries against the following regex: `/[dehlorw01]/`. Also, length was graded. In this, it just requires no usage of strings (and probably no `char[][]`, wither). Length isn't counted, but creativity is the main decisive factor, thus the [tag:popularity-contest] tag.

    Alas, my 100 rep bonus (for my StackOverflow rep) apparently doesn't qualify as having earned 10+ rep on codegolf, so I can't provide my .NET version as an answer.

    @EdmundSchweppe Association bonus does not counts to the purpose of protected questions, but I don't know why this one was protected. Anyway, getting one upvote in some other question here and get the 10 reputation poins is not hard, and then you may post your answer to this question.

    No string literals or no strings at all?

    @Victor I'll confess surprise that the association bonus wouldn't count towards protected questions; however, as you say, getting one upvote elsewhere isn't that hard.

    @EdmundSchweppe Yeah, you are not the first one here to get surprised by that SE rule.

    Why did my edit get rejected? (I know it wasn't helpful, but I've voted to reopen, so don't just say "it introduced tags that are not helpful".)

  • Python 2



    I happened to be playing with this yesterday, so:



    (lambda _, __, ___, ____, _____, ______, _______, ________: getattr(__import__(True.__class__.__name__[_] + [].__class__.__name__[__]), ().__class__.__eq__.__class__.__name__[:__] + ().__iter__().__class__.__name__[_____:________])(_, (lambda _, __, ___: _(_, __, ___))(lambda _, __, ___: chr(___ % __) + _(_, __, ___ // __) if ___ else (lambda: _).func_code.co_lnotab, _ << ________, (((_____ << ____) + _) << ((___ << _____) - ___)) + (((((___ << __) - _) << ___) + _) << ((_____ << ____) + (_ << _))) + (((_______ << __) - _) << (((((_ << ___) + _)) << ___) + (_ << _))) + (((_______ << ___) + _) << ((_ << ______) + _)) + (((_______ << ____) - _) << ((_______ << ___))) + (((_ << ____) - _) << ((((___ << __) + _) << __) - _)) - (_______ << ((((___ << __) - _) << __) + _)) + (_______ << (((((_ << ___) + _)) << __))) - ((((((_ << ___) + _)) << __) + _) << ((((___ << __) + _) << _))) + (((_______ << __) - _) << (((((_ << ___) + _)) << _))) + (((___ << ___) + _) << ((_____ << _))) + (_____ << ______) + (_ << ___))))(*(lambda _, __, ___: _(_, __, ___))((lambda _, __, ___: [__(___[(lambda: _).func_code.co_nlocals])] + _(_, __, ___[(lambda _: _).func_code.co_nlocals:]) if ___ else []), lambda _: _.func_code.co_argcount, (lambda _: _, lambda _, __: _, lambda _, __, ___: _, lambda _, __, ___, ____: _, lambda _, __, ___, ____, _____: _, lambda _, __, ___, ____, _____, ______: _, lambda _, __, ___, ____, _____, ______, _______: _, lambda _, __, ___, ____, _____, ______, _______, ________: _)))


    Here is a more readable version: http://codepad.org/UzSmoxF2



    Notes:




    • One line, single expression (i.e. no print statement).


    • No strings, no ints; only functions, attribute access, lists, tuples, basic math, one True, and one star-args.


    • Minimal builtin usage (__import__, getattr, and chr once each).


    • The payload can be changed easily. Here is the program I wrote to generate it.




    Edit: I wrote a fairly substantial explanation of how this works on my blog.


    Nice. Highly readable.

    "more readable version"

    Congrats on 100!

License under CC-BY-SA with attribution


Content dated before 7/24/2021 11:53 AM