Shortest code to produce infinite output

Question

Write the shortest code you can that produces an infinite output.

That's all. You code will only be disqualified if it stops producing output at some point. As always in code golf, the shortest code wins.

Here's a list of answers that I think are really clever, so they can get credit:

Leaderboard

var QUESTION_ID=13152,OVERRIDE_USER=8611;function answersUrl(e){return"https://api.stackexchange.com/2.2/questions/"+QUESTION_ID+"/answers?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+ANSWER_FILTER}function commentUrl(e,s){return"https://api.stackexchange.com/2.2/answers/"+s.join(";")+"/comments?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+COMMENT_FILTER}function getAnswers(){jQuery.ajax({url:answersUrl(answer_page++),method:"get",dataType:"jsonp",crossDomain:!0,success:function(e){answers.push.apply(answers,e.items),answers_hash=[],answer_ids=[],e.items.forEach(function(e){e.comments=[];var s=+e.share_link.match(/\d+/);answer_ids.push(s),answers_hash[s]=e}),e.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){jQuery.ajax({url:commentUrl(comment_page++,answer_ids),method:"get",dataType:"jsonp",crossDomain:!0,success:function(e){e.items.forEach(function(e){e.owner.user_id===OVERRIDE_USER&&answers_hash[e.post_id].comments.push(e)}),e.has_more?getComments():more_answers?getAnswers():process()}})}function getAuthorName(e){return e.owner.display_name}function process(){var e=[];answers.forEach(function(s){var r=s.body;s.comments.forEach(function(e){OVERRIDE_REG.test(e.body)&&(r="<h1>"+e.body.replace(OVERRIDE_REG,"")+"</h1>")});var a=r.match(SCORE_REG);a&&e.push({user:getAuthorName(s),size:+a[2],language:a[1],link:s.share_link})}),e.sort(function(e,s){var r=e.size,a=s.size;return r-a});var s={},r=1,a=null,n=1;e.forEach(function(e){e.size!=a&&(n=r),a=e.size,++r;var t=jQuery("#answer-template").html();t=t.replace("{{PLACE}}",n+".").replace("{{NAME}}",e.user).replace("{{LANGUAGE}}",e.language).replace("{{SIZE}}",e.size).replace("{{LINK}}",e.link),t=jQuery(t),jQuery("#answers").append(t);var o=e.language;/<a/.test(o)&&(o=jQuery(o).text()),s[o]=s[o]||{lang:e.language,user:e.user,size:e.size,link:e.link}});var t=[];for(var o in s)s.hasOwnProperty(o)&&t.push(s[o]);t.sort(function(e,s){return e.lang>s.lang?1:e.lang<s.lang?-1:0});for(var c=0;c<t.length;++c){var i=jQuery("#language-template").html(),o=t[c];i=i.replace("{{LANGUAGE}}",o.lang).replace("{{NAME}}",o.user).replace("{{SIZE}}",o.size).replace("{{LINK}}",o.link),i=jQuery(i),jQuery("#languages").append(i)}}var ANSWER_FILTER="!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe",COMMENT_FILTER="!)Q2B_A2kjfAiU78X(md6BoYk",answers=[],answers_hash,answer_ids,answer_page=1,more_answers=!0,comment_page;getAnswers();var SCORE_REG=/<h\d>\s*([^\n,]*[^\s,]),.*?(\d+)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/,OVERRIDE_REG=/^Override\s*header:\s*/i;

body{text-align:left!important}#answer-list,#language-list{padding:10px;width:290px;float:left}table thead{font-weight:700}table td{padding:5px}

<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <link rel="stylesheet" type="text/css" href="//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b"> <div id="answer-list"> <h2>Leaderboard</h2> <table class="answer-list"> <thead> <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr></thead> <tbody id="answers"> </tbody> </table> </div><div id="language-list"> <h2>Winners by Language</h2> <table class="language-list"> <thead> <tr><td>Language</td><td>User</td><td>Score</td></tr></thead> <tbody id="languages"> </tbody> </table> </div><table style="display: none"> <tbody id="answer-template"> <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table> <table style="display: none"> <tbody id="language-template"> <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table>

All answers disqualified because at some point the Earth will be swallowed by the sun, and at some point the universe will die :P — Doorknob
– Doorknob, Commented Nov 9, 2013 at 20:00
If I write mine in Piet, can I count the pixels of the text the other programs used? I believe the smallest possible repeating Piet program would be 6 pixels. That beats Befunge if "off" pixels still count. — DampeS8N
– DampeS8N, Commented Nov 12, 2013 at 20:27
@Izkata So any answer that crashes your computer is also allowed :D — ɐɔıʇǝɥʇuʎs
– ɐɔıʇǝɥʇuʎs, Commented Jul 11, 2014 at 20:11
@Doorknob So really, the challenge is to produce infinite output in a finite amount of time. Sounds easy enough. — Sanchises
– Sanchises, Commented Apr 10, 2015 at 21:15

rink.attendant.6 · Accepted Answer · 2014-09-03 22:29:41Z

0

CoffeeScript, 14

Pretty unoriginal and similar to JavaScript:

alert 6while 1

answered Sep 3, 2014 at 22:29

rink.attendant.6

2,89617 silver badges30 bronze badges

\$\begingroup\$ There is a loop keyword, this could be shortened down to loop alert 1 \$\endgroup\$

eosterberg
– eosterberg

2015-04-11 16:03:06 +00:00
Commented Apr 11, 2015 at 16:03

Add a comment |

g.carvalho97 · Accepted Answer · 2014-09-06 02:42:34Z

0

PHP: 22 chars

<?PHP while(true){print(0);} ?>

My first golf, hope I did it right :)
It will hang your browser if you do it on a PHP page, but from the command line it does the expected: prints something until you get bored and stop it.

edited Sep 6, 2014 at 2:42

answered Jul 3, 2014 at 21:30

g.carvalho97

1394 bronze badges

\$\begingroup\$ Because you this is php, you can just put while(true){print(0);} the <?php ... ?> isn't actually php anyway \$\endgroup\$

addison
– addison

2014-09-01 23:43:54 +00:00
Commented Sep 1, 2014 at 23:43
\$\begingroup\$ And the php portion of your answer, while(true){print(0);}, is actually 22 characters. \$\endgroup\$

addison
– addison

2014-09-01 23:45:24 +00:00
Commented Sep 1, 2014 at 23:45

Add a comment |

mbomb007 · Accepted Answer · 2015-04-10 20:57:01Z

0

Chinese, 2 bytes

谕

Prints ÿ continuously.

edited Apr 10, 2015 at 20:57

mbomb007

23.6k7 gold badges66 silver badges143 bronze badges

answered Jan 28, 2014 at 18:18

Timtech

12.7k2 gold badges46 silver badges63 bronze badges

\$\begingroup\$ Isn't that two bytes? \$\endgroup\$

John Dvorak
– John Dvorak

2014-01-29 15:54:09 +00:00
Commented Jan 29, 2014 at 15:54
\$\begingroup\$ @JanDvorak He didn't specify chars or bytes, and chars is default. \$\endgroup\$

Timtech
– Timtech

2014-01-29 16:08:19 +00:00
Commented Jan 29, 2014 at 16:08
6

\$\begingroup\$ @Timtech According to the code-golf tag: If you use Unicode, byte count should use UTF-8. \$\endgroup\$

Sylwester
– Sylwester

2014-01-29 22:14:56 +00:00
Commented Jan 29, 2014 at 22:14
\$\begingroup\$ @Sylwester Okay \$\endgroup\$

Timtech
– Timtech

2014-01-29 23:07:33 +00:00
Commented Jan 29, 2014 at 23:07

Add a comment |

SuperJedi224 · Accepted Answer · 2015-04-11 00:03:05Z

0

I haven't seen Thue used here much, so here we go:

Thue (22 19 bytes)

 a::=ab b::=~1 ::= a

edited Apr 11, 2015 at 0:03

answered Apr 10, 2015 at 23:53

SuperJedi224

12k2 gold badges46 silver badges68 bronze badges

Add a comment |

M L · Accepted Answer · 2015-07-01 14:18:14Z

Cardinal, 3 characters

.%$

Explanation:

. print active value % start pointers here $ jump to x,y = active, inactive value .%$ Pointers spread out in all cardinal directions from every % All pointers carry two values, initialized to 0. The upper value is called the active value, and it can be accessed directly. The lower value is called inactive value. Inactive values can only be accessed by flipping both values, switching the active to inactive, and the inactive to active, or by using instructions like $ that grab the inactive value directly to e.g. execute a jump. The < and > below the values are the positional and directional markers of the pointers. In programs, they instruct pointers to change the movement direction. 0 0 At this step, the first active value (from the left pointer) 0 0 gets printed in the console, the right pointer is going to <%> jump to x,y=0,0 0 The jumped (former left) pointer prints out the next 0 0 >%$ 0 0 ... travels on ... .>$ 0 0 .%> ... reaches the jump instruction again, going to jump to 0,0 again 0 0 >%$ ... print out the next 0... and so on, to infinity.

http://esolangs.org/wiki/Cardinal

Qwertiy · Accepted Answer · 2015-07-01 20:38:01Z

Bat, 2 chars

%0

The output is (starting from a blank line, I've added nbsp to make it visible bellow)

  d:\Temp\Supertemp>"D:\Temp\Supertemp\inf.bat" d:\Temp\Supertemp>"D:\Temp\Supertemp\inf.bat" d:\Temp\Supertemp>"D:\Temp\Supertemp\inf.bat" d:\Temp\Supertemp>"D:\Temp\Supertemp\inf.bat" d:\Temp\Supertemp>"D:\Temp\Supertemp\inf.bat" d:\Temp\Supertemp>"D:\Temp\Supertemp\inf.bat"

This is dependent to where you have stored the file, but it will always output. This is an example output. — Erik the Outgolfer
– Erik the Outgolfer, Commented Oct 6, 2016 at 19:02

SjoerdPennings · Accepted Answer · 2015-10-15 15:50:41Z

><> Fish - 2 characters, I'm counting the shortest one.

Thijs beat me to it, but oh well. Here are a couple more ><> answers.

1n
-Infinite 1's, 2 bytes

 >"drlow ,olleH"l ? ! ^ < o

-Infinite "Hello, world", 84 bytes.

Edit: Whoops. It's character count, not bytecount. I also fixed the first answer. Edit 2: Thanks mbomb007 for shaving off 1 character.

\$\begingroup\$ Why not just use 1n? \$\endgroup\$

mbomb007
– mbomb007

2015-10-15 15:46:20 +00:00
Commented Oct 15, 2015 at 15:46 — mbomb007
– mbomb007, Commented Oct 15, 2015 at 15:46
\$\begingroup\$ @mbomb007 Whoops, forgot that I could do that. \$\endgroup\$

SjoerdPennings
– SjoerdPennings

2015-10-15 15:49:05 +00:00
Commented Oct 15, 2015 at 15:49 — SjoerdPennings
– SjoerdPennings, Commented Oct 15, 2015 at 15:49
\$\begingroup\$ "n also works. \$\endgroup\$

mbomb007
– mbomb007

2015-10-15 16:01:29 +00:00
Commented Oct 15, 2015 at 16:01 — mbomb007
– mbomb007, Commented Oct 15, 2015 at 16:01

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

GoLunar, 4 bytes

This is the equivalent of 5543 zeros in a row in Unary, which is equivalent to +[.] in BrainF***.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 10, 2015 at 21:12

mbomb007

23.6k7 gold badges66 silver badges143 bronze badges

Add a comment |

SuperJedi224 · Accepted Answer · 2015-10-15 21:56:42Z

BotEngine, 1x3=3

Noncompeting as BotEngine is much too recent a language. Anyway, here we go:

>CT

It starts with a right-moving bot on the >. When it reaches the C, it creates a left-moving bot (which starts on the C.) On the next step, the left-moving bot reaches the > and is turned around to move right and the right-moving bot reaches the T, destroying itself and printing TRUE. The step after that, the other bot gets to the C starting the process over again.

>CF also works but prints FALSE instead of TRUE. Using P in this case would print empty lines instead.

Community · Accepted Answer · 2020-06-17 09:04:33Z

Javascript ES6, 28 bytes

setInterval`console.log()`

I didn't want to code an infinite for loop like everyone else...

Try it here using anything BUT Firefox.

Community · Accepted Answer · 2020-06-17 09:04:33Z

Mouse-2002, 3 bytes

(0!)

prints 0 forever.

Alternatively, for a more interesting and (theoretically) infinite error with no loop, the Ackermann Function in 99 bytes in this language:

"M>"?a:"N>"?b:#Y,a.b.;$Y1%n:2%m:m.0=k:n.0=j:j.k.>[n.1+!|j.k.<[#Y,m.1-,1;!|#Y,m.1-,#Y,n.,n.1-;;!]]]@

Expanded:

"M>" ? a: "N>" ? b: 1 a: 1 b: #Y, a. b.;! $Y 1% n: 2% m: ~ ack m. 0 = k: ~ store whether m == 0 in k n. 0 = j: j. k. > [ ~ if y>x n.1+ ~ print it | j. k. < [ ~ if x>y #Y, m. 1-, 1; | #Y, m. 1-, #Y, m.,n. 1-;;! ] ] ] @ $

Errors recursively, forever, as long as the input was a positive nonzero integer. (result of a bug in the interpreter: the code is correct!)

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

𝔼𝕊𝕄𝕚𝕟, 4 chars / 7 bytes

↻ô1;

Try it here (Firefox only).

Translates to while(output(1)); in JS.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jan 25, 2016 at 1:39

Mama Fun Roll

9,9781 gold badge38 silver badges47 bronze badges

\$\begingroup\$ output isn't a JS function... \$\endgroup\$

mbomb007
– mbomb007

2018-04-26 14:07:05 +00:00
Commented Apr 26, 2018 at 14:07
\$\begingroup\$ There isn't really an equivalent to that function in JS, I guess I made it a placeholder name for the custom output function that ESMin uses. \$\endgroup\$

Mama Fun Roll
– Mama Fun Roll

2018-04-30 14:11:15 +00:00
Commented Apr 30, 2018 at 14:11
\$\begingroup\$ console.log would work \$\endgroup\$

mbomb007
– mbomb007

2018-04-30 14:51:44 +00:00
Commented Apr 30, 2018 at 14:51
\$\begingroup\$ The function doesn't output by lines, but rather appends to output... Perhaps it's more like a process.stdout.write. \$\endgroup\$

Mama Fun Roll
– Mama Fun Roll

2018-04-30 20:08:12 +00:00
Commented Apr 30, 2018 at 20:08

Add a comment |

Cyoce · Accepted Answer · 2016-01-31 20:27:58Z

0

C, 25 bytes

main(){while(puts("1"));}

edited Jan 31, 2016 at 20:27

Cyoce

3,37126 silver badges29 bronze badges

answered Jan 29, 2014 at 5:12

Raghuram

1093 bronze badges

Add a comment |

Argenis García · Accepted Answer · 2016-02-15 15:56:02Z

0

R, 15 bytes

Infinitely prints 1

while(T)cat(1)

answered Feb 15, 2016 at 15:56

Argenis García

2451 silver badge5 bronze badges

Add a comment |

SuperJedi224 · Accepted Answer · 2016-02-29 20:36:59Z

ForceLang, 23 bytes

label l io.write goto l

Looks weird, but it works. The key here is that goto does not interrupt the evaluation of the current line, and returns nil.

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Pylons, 5

wp,1}

While 1, print the (empty) stack.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 29, 2016 at 20:41

Morgan Thrapp

3,68616 silver badges29 bronze badges

Add a comment |

SuperJedi224 · Accepted Answer · 2016-03-25 19:48:28Z

0

Come Here, 21 bytes

COME FROM1 1TELL1NEXT

In the reference implementation, this prints infinitely many smiley characters. Don't ask me why.

edited Mar 25, 2016 at 19:48

answered Mar 25, 2016 at 12:06

SuperJedi224

12k2 gold badges46 silver badges68 bronze badges

\$\begingroup\$ The smiley characters are printed because you are using Windows cmd. \$\endgroup\$

Erik the Outgolfer
– Erik the Outgolfer

2016-10-06 18:58:45 +00:00
Commented Oct 6, 2016 at 18:58

Add a comment |

mark · Accepted Answer · 2016-05-26 20:45:56Z

0

Clojure, 14 bytes

(pr(cycle[1]))

answered May 26, 2016 at 20:45

mark

2711 silver badge3 bronze badges

Add a comment |

TuxCrafting · Accepted Answer · 2016-05-28 23:10:48Z

0

Brainfuck, 26 bytes

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

Do 4*4*2+1 (33, !) and the final loop is a infinite loop that only print the current memory cell (!).

answered May 28, 2016 at 23:10

TuxCrafting

4,8373 gold badges34 silver badges46 bronze badges

\$\begingroup\$ You could as well do +[.] (SOH), but then it would be a dupe. \$\endgroup\$

Erik the Outgolfer
– Erik the Outgolfer

2016-10-08 18:12:20 +00:00
Commented Oct 8, 2016 at 18:12

Add a comment |

user8397947 · Accepted Answer · 2016-05-29 00:22:15Z

Haystack, 6 bytes (non-competing, the language came 2 years after the challenge)

>"a"o<

This will print a [infinity] times.

If the above code gives a syntax error because of the lack of | (that character is the needle. The ultimate goal of all Haystack programs is to find the needle in the haystack), one can simply append it to the end:

>"a"o<|

McKay · Accepted Answer · 2016-09-07 21:42:16Z

0

Golfscript - 7

{1a}:a~

I'm still learing golfscript, but unless I'm mistaken, this puts 1 on the stack, then starts over?

But apparently, the stack only prints when the program terminates, so perhaps this is better:

{1.p}do

(thanks Dennis)

edited Sep 7, 2016 at 21:42

answered Jan 29, 2014 at 20:49

McKay

3684 silver badges10 bronze badges

\$\begingroup\$ You need a space between 1 and a, otherwise it's a single variable. I suggest using a non-alnum as a variable name {1?}:?+. Also, this doesn't print anything. \$\endgroup\$

John Dvorak
– John Dvorak

2014-03-04 05:31:15 +00:00
Commented Mar 4, 2014 at 5:31
1

\$\begingroup\$ This won't work, it will just print a stack level too deep error. Also, the stack is printed when the program finishes, so you have to print explicitly. Example: {1.p}do (7 bytes) @JanDvorak: [A-Za-z]+[0-9]+ is a single token, but [0-9]+[A-Za-z]+ is not. \$\endgroup\$

Dennis
– Dennis

2014-06-21 18:46:35 +00:00
Commented Jun 21, 2014 at 18:46
\$\begingroup\$ I would downvote, but my vote is locked in. Help me out! \$\endgroup\$

tbodt
– tbodt

2014-09-03 21:54:48 +00:00
Commented Sep 3, 2014 at 21:54
\$\begingroup\$ Edited as per @Dennis \$\endgroup\$

McKay
– McKay

2016-09-07 21:42:33 +00:00
Commented Sep 7, 2016 at 21:42

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Kitanai, 24 bytes

#print"0"&2&1#print"1"&~

The "#" defines a flag, the first "print" displays 0, then the "&2" jumps to the second "#", it then prints "1", goes to the origin ("&~") which is just after "&2", then it jumps to the first "#" thanks to the "&1". And it does all that infinitely :)

Conor O'Brien · Accepted Answer · 2016-12-23 23:00:41Z

FALSE, 8 bytes

Interpreter.

There are many programs that work, each 8 bytes. The one I find the most interesting is:

[1$][.]#

This is a while loop (#). [1$] is the condition, and it pushes two 1s. The last is popped for the condition (true), and then [.] is executed, which prints the number.

Here are some other programs (including the above):

[1$][.]# [1][1.]# [1$.][]# [^^.][]# [^.^][]# [^][^.]#

A more interesting 9-byte (arbitrary 1-char repeated):

['c$,][]#

I feel that the following 7-byte programs should work on some FALSE interpreters, but I haven't found any such yet:

[1"][]# [.1][]#

ETHproductions · Accepted Answer · 2017-01-18 00:05:38Z

Haxe, 19 bytes

while(1>0)trace(1);

There are several things about Haxe that make this challenge more difficult than in similar languages:

Its lack of a for(;;) loop
Its unwillingness to consider anything other than true or false truthy or falsy
Its unwillingness to print an empty line (with trace();)

If not for these things, this program might have been 15 bytes:

for(;;)trace();

Test it online here, though you may not want to, as it freezes your browser.

Matthew Roh · Accepted Answer · 2017-01-23 23:40:17Z

0

C++, 23 bytes

main(){for(;;)puts(";");}

I was too lazy, but hey, It outputs a javascript script, which does absolutely nothing!

edited Jan 23, 2017 at 23:40

answered Jan 23, 2017 at 16:33

Matthew Roh

5,4154 gold badges31 silver badges61 bronze badges

\$\begingroup\$ This submission is neither a full program nor a function and thus is invalid (since snippets are disallowed). \$\endgroup\$

user41805
– user41805

2017-01-23 16:36:31 +00:00
Commented Jan 23, 2017 at 16:36
1

\$\begingroup\$ Now with FULL program! \$\endgroup\$

Matthew Roh
– Matthew Roh

2017-01-23 23:40:37 +00:00
Commented Jan 23, 2017 at 23:40

Add a comment |

user63331 · Accepted Answer · 2017-02-11 21:06:33Z

QC 6 bytes

Not competing because language is newer than the question

A00$00

A00 prints nothing(because memory is empty) and a new line $00 jump to start(no recursion, sets instruction pointer to 00)

Shaun Bebbers · Accepted Answer · 2017-02-16 12:14:37Z

Commodore 64/VIC-20 assembly, 8 bytes (assembled)

033C LDA #$40 033E JSR $FFD2 0341 JMP $033E

When executed with SYS 828, this will continuously output the @ character to the screen using the Kernal routine to print. If you don't care what you're outputting, then you can remove 033C LDA #$40 and save two whole bytes (the last thing in the accumulator will be outputted).

If you remove the code at 033C then you will need to execute with SYS 830, unless you start the code at 033C and change JMP 033E accordingly. — Shaun Bebbers
– Shaun Bebbers, Commented Feb 16, 2017 at 12:16

jqkul · Accepted Answer · 2017-02-16 18:20:41Z

Fith, 16 bytes

{ 1 . q } :: q q

{ 1 . q } pushes to the stack an anonymous function which prints 1 then calls a function named q. :: q binds this function to the word q, then the final q calls the new infinitely-recursing function.

Non-recursive version (19 bytes):

{ 1 } { 1 . } while

This pushes a condition function, which will always push 1, and a body function, which prints 1. The while word continues to run the body as long as the condition leaves a truthy value on top of the stack.

Community · Accepted Answer · 2020-06-17 09:04:33Z

Whitespace, 16 bytes

Try it online!

Saves 3 bytes on the previous Whitespace answer by abusing empty labels and declaring the value 0 as a 0-bit number (the spec unfortunately requires a sign bit). Posting as a new answer as the previous answer combines multiple unrelated entries.

Explanation

(s - space, t - tab, n - newline)

nssn # Declare label '' sssn # Push +0 onto the stack tnst # Pop and output the stack value as a number - outputs the character '0' nsnn # Jump to label ''

I'm kinda pleased that this answer uses four 4-byte instructions — Ephphatha
– Ephphatha, Commented May 27, 2017 at 13:23

MD XF · Accepted Answer · 2017-06-06 04:10:59Z

shortC, 5 bytes

AWP'1

Prints 1 forever. Explanation:

A main function W forever P print char '1 char '1'

Try it online!

Stack Exchange Network

Shortest code to produce infinite output

Leaderboard

349 Answers 349

CoffeeScript, 14

Chinese, 2 bytes

Thue (22 19 bytes)

Cardinal, 3 characters

Bat, 2 chars

><> Fish - 2 characters, I'm counting the shortest one.

GoLunar, 4 bytes

BotEngine, 1x3=3

Javascript ES6, 28 bytes

Mouse-2002, 3 bytes

𝔼𝕊𝕄𝕚𝕟, 4 chars / 7 bytes

C, 25 bytes

R, 15 bytes

ForceLang, 23 bytes

Pylons, 5

Come Here, 21 bytes

Clojure, 14 bytes

Brainfuck, 26 bytes

Haystack, 6 bytes (non-competing, the language came 2 years after the challenge)

Golfscript - 7

Kitanai, 24 bytes

FALSE, 8 bytes

Haxe, 19 bytes

C++, 23 bytes

QC 6 bytes

Commodore 64/VIC-20 assembly, 8 bytes (assembled)

Fith, 16 bytes

Non-recursive version (19 bytes):

Whitespace, 16 bytes

Explanation

shortC, 5 bytes

Linked

Hot Network Questions

Shortest code to produce infinite output

Leaderboard

349 Answers 349

CoffeeScript, 14

Chinese, 2 bytes

Thue (22 19 bytes)

Cardinal, 3 characters

Bat, 2 chars

><> Fish - 2 characters, I'm counting the shortest one.

GoLunar, 4 bytes

BotEngine, 1x3=3

Javascript ES6, 28 bytes

Mouse-2002, 3 bytes

𝔼𝕊𝕄𝕚𝕟, 4 chars / 7 bytes

C, 25 bytes

R, 15 bytes

ForceLang, 23 bytes

Pylons, 5

Come Here, 21 bytes

Clojure, 14 bytes

Brainfuck, 26 bytes

Haystack, 6 bytes (non-competing, the language came 2 years after the challenge)

Golfscript - 7

Kitanai, 24 bytes

FALSE, 8 bytes

Haxe, 19 bytes

C++, 23 bytes

QC 6 bytes

Commodore 64/VIC-20 assembly, 8 bytes (assembled)

Fith, 16 bytes

Non-recursive version (19 bytes):

Whitespace, 16 bytes

Explanation

shortC, 5 bytes

Linked

Related

Hot Network Questions