1
\$\begingroup\$

This question already has an answer here:

Much like this challenge, write a program or function that takes no input and prints or returns the string

Hello, Earth!

with an optional trailing newline.

The catch is that your program must be an even number of characters long, and each two character chunk of your program must consist of identical characters.

For example, a valid program might look like

AAbb==11++♥♥

[[--  2222]]

because every two character chunk (AA, bb, ==, 11, etc.) is made of two identical characters (even the newlines).

A program such as

AAbB==11++♥♥

[[--  2222]]

would not be valid because the bB chunk is not made of identical characters.

The only exception to the rule is that \r\n should be treated a single, generic "newline" character since replacing it with \r\r\n\n wouldn't work or make sense for some languages and systems.

The shortest code in bytes wins. The example is 30 bytes long (not 15, not 13).

\$\endgroup\$

marked as duplicate by Sp3000 code-golf Sep 8 '16 at 0:49

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • 3
    \$\begingroup\$ You are banning most non esolangs \$\endgroup\$ – Rohan Jhunjhunwala Sep 7 '16 at 23:56
  • 1
    \$\begingroup\$ @RohanJhunjhunwala That's the way it goes. \$\endgroup\$ – Calvin's Hobbies Sep 8 '16 at 0:01
  • 5
    \$\begingroup\$ @Downgoat I think this a perfectly valid/interesting challenge, and I don't see any language restrictions. \$\endgroup\$ – Conor O'Brien Sep 8 '16 at 0:06
  • 4
    \$\begingroup\$ @ConorO'Brien you may vote how you like. I am entitled as so too, I always comment when I downvote \$\endgroup\$ – Downgoat Sep 8 '16 at 0:09
  • 2
    \$\begingroup\$ Not trying to start/prolong a discussion, and you're certainly entitled to vote as you see fit, but new users usually create yet another incarnation of perform task T without using the characters XYZ or the built-in B, which is utterly repetitive and on occasions unclear. \$\endgroup\$ – Dennis Sep 8 '16 at 2:40
6
\$\begingroup\$

Lenguage, 1354616599400377002855073561913010716386821416114463012 bytes

It's 1354616599400377002855073561913010716386821416114463012 zeroes:

0000000000000000000000000000000000000000000000000000000000000000000000000000000000...00000000

It's this BF program:

-[------->+<]>-.-[->+++++<]>++.+++++++..+++.[->+++++<]>+.------------.++[->++<]>+.+[------>+<]>.--[--->+<]>---.++.------------.--[--->+<]>-.

Converted into binary:

001110001001001001001001001010000011111010001100001110001010000000000000000011111010000000100000000000000000000000100100000000000100110001010000000000000000011111010000100001001001001001001001001001001001001100000000110001010000000011111010000100000110001001001001001001010000011111010100001001110001001001010000011111010001001001100000000100001001001001001001001001001001001001100001001110001001001010000011111010001100

Converted into a decimal number:

1354616599400377002855073561913010716386821416114463012

With that many zeroes. Hooray for lenguage!

\$\endgroup\$
  • \$\begingroup\$ I had a 70 byte fish answer but didn't finish before this was closed... \$\endgroup\$ – Blue Sep 8 '16 at 1:16
  • \$\begingroup\$ @Blue Do you mean the shell? \$\endgroup\$ – Erik the Outgolfer Sep 8 '16 at 15:36
  • \$\begingroup\$ @EriktheGolfer it was pretty much the same as the fish answer of the duped questions, just like this is kind of like the unary answer of the duped question. \$\endgroup\$ – Blue Sep 8 '16 at 16:26
  • \$\begingroup\$ @Blue I mean, is it ><> or is it fish? I guess it's ><>, but that's not called 'Fish', it's the Esolang page that has technical limitations. \$\endgroup\$ – Erik the Outgolfer Sep 8 '16 at 16:31

Not the answer you're looking for? Browse other questions tagged or ask your own question.