Count up forever

Question

Write a program that counts up forever, starting from one.

Rules:

• Your program must log to STDOUT or an acceptable alternative, if STDOUT is not available.
• Your program must be a full, runnable program, and not a function or snippet.
• Your program must output each number with a separating character in between (a newline, space, tab or comma), but this must be consistent for all numbers.
• You may print the numbers in decimal, in unary or in base 256 where each digit is represented by a byte value.
• Your program must count at least as far as 2¹²⁸ (inclusive) without problems and without running out of memory on a reasonable desktop PC. In particular, this means if you're using unary, you cannot store a unary representation of the current number in memory.

• Unlike our usual rules, feel free to use a language (or language version) even if it's newer than this challenge. Languages specifically written to submit a 0-byte answer to this challenge are fair game but not particularly interesting.

  Note that there must be an interpreter so the submission can be tested. It is allowed (and even encouraged) to write this interpreter yourself for a previously unimplemented language.

• This is not about finding the language with the shortest solution for this (there are some where the empty program does the trick) - this is about finding the shortest solution in every language. Therefore, no answer will be marked as accepted.

Catalogue

The Stack Snippet at the bottom of this post generates the catalogue from the answers a) as a list of shortest solution per language and b) as an overall leaderboard.

To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:

## Language Name, N bytes

where N is the size of your submission. If you improve your score, you can keep old scores in the headline, by striking them through. For instance:

## Ruby, <s>104</s> <s>101</s> 96 bytes

If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:

## Perl, 43 + 2 (-p flag) = 45 bytes

You can also make the language name a link which will then show up in the snippet:

## [><>](http://esolangs.org/wiki/Fish), 121 bytes

<style>body { text-align: left !important} #answer-list { padding: 10px; width: 290px; float: left; } #language-list { padding: 10px; width: 290px; float: left; } table thead { font-weight: bold; } table td { padding: 5px; }</style><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="language-list"> <h2>Shortest Solution 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> <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> <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><script>var QUESTION_ID = 63834; var ANSWER_FILTER = "!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe"; var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk"; var OVERRIDE_USER = 39069; var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page; function answersUrl(index) { return "//api.stackexchange.com/2.2/questions/" + QUESTION_ID + "/answers?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + ANSWER_FILTER; } function commentUrl(index, answers) { return "//api.stackexchange.com/2.2/answers/" + answers.join(';') + "/comments?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + COMMENT_FILTER; } function getAnswers() { jQuery.ajax({ url: answersUrl(answer_page++), method: "get", dataType: "jsonp", crossDomain: true, success: function (data) { answers.push.apply(answers, data.items); answers_hash = []; answer_ids = []; data.items.forEach(function(a) { a.comments = []; var id = +a.share_link.match(/\d+/); answer_ids.push(id); answers_hash[id] = a; }); if (!data.has_more) more_answers = false; comment_page = 1; getComments(); } }); } function getComments() { jQuery.ajax({ url: commentUrl(comment_page++, answer_ids), method: "get", dataType: "jsonp", crossDomain: true, success: function (data) { data.items.forEach(function(c) { if (c.owner.user_id === OVERRIDE_USER) answers_hash[c.post_id].comments.push(c); }); if (data.has_more) getComments(); else if (more_answers) getAnswers(); else process(); } }); } getAnswers(); var SCORE_REG = /<h\d>\s*([^\n,<]*(?:<(?:[^\n>]*>[^\n<]*<\/[^\n>]*>)[^\n,<]*)*),.*?(\d+)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/; var OVERRIDE_REG = /^Override\s*header:\s*/i; function getAuthorName(a) { return a.owner.display_name; } function process() { var valid = []; answers.forEach(function(a) { var body = a.body; a.comments.forEach(function(c) { if(OVERRIDE_REG.test(c.body)) body = '<h1>' + c.body.replace(OVERRIDE_REG, '') + '</h1>'; }); var match = body.match(SCORE_REG); if (match) valid.push({ user: getAuthorName(a), size: +match[2], language: match[1], link: a.share_link, }); else console.log(body); }); valid.sort(function (a, b) { var aB = a.size, bB = b.size; return aB - bB }); var languages = {}; var place = 1; var lastSize = null; var lastPlace = 1; valid.forEach(function (a) { if (a.size != lastSize) lastPlace = place; lastSize = a.size; ++place; var answer = jQuery("#answer-template").html(); answer = answer.replace("{{PLACE}}", lastPlace + ".") .replace("{{NAME}}", a.user) .replace("{{LANGUAGE}}", a.language) .replace("{{SIZE}}", a.size) .replace("{{LINK}}", a.link); answer = jQuery(answer); jQuery("#answers").append(answer); var lang = a.language; lang = jQuery('<a>'+lang+'</a>').text(); languages[lang] = languages[lang] || {lang: a.language, lang_raw: lang.toLowerCase(42), user: a.user, size: a.size, link: a.link}; }); var langs = []; for (var lang in languages) if (languages.hasOwnProperty(lang)) langs.push(languages[lang]); langs.sort(function (a, b) { if (a.lang_raw > b.lang_raw) return 1; if (a.lang_raw < b.lang_raw) return -1; return 0; }); for (var i = 0; i < langs.length; ++i) { var language = jQuery("#language-template").html(); var lang = langs[i]; language = language.replace("{{LANGUAGE}}", lang.lang) .replace("{{NAME}}", lang.user) .replace("{{SIZE}}", lang.size) .replace("{{LINK}}", lang.link); language = jQuery(language); jQuery("#languages").append(language); } }</script>

Answer 1

Rust, 46 45 40 39 bytes

fn main(){for x in 1..{print!("{x}
")}}

Attempt This Online!

Answer 2

punchcode, 6 bytes

[RS][ESC][VT][GS][CR][LF]

uncompiled:

-START  |
---OOOO-|
---OO-OO|
----O-OO|
---OOO-O|
----OO-O|

Answer 3

BrainChild, 108 bytes

include *;while(int a~-1|int b~-1|int c~-1|int d~-1){if(!++a)if(!++b)if(!++c)d++printf("$0$1$2$3 ",d,c,b,a)}

Brainchild doesn't support 128 bit integers, so this solution just tracks 4 separate 32 bit integers and ticks the next one every time the last one rolls over. This version of Brainchild neglected to implement binary not, so xor -1 is used instead.

Try It Online!

Answer 4

PowerShell, 19 14 Bytes

for(){$i++;$i}

Removed echo as per user recommendation

Answer 5

Pylongolf2, 6 bytes

0>1+~<

Have a zero in the stack and continously add up to it.
I could give a more detailed explanation.

Pylongolf2, 20 bytes (bonus)

cn:A0>1+~_A@1=?t¿d<

Only works in beta 6, but this version asks for what number to count to.

Answer 6

PRINDEAL, 21

a c 
 i n 
 r 
 c
a r 
 p n 
 c 
 r

Preceds each number printed with n = , because it is not possible to print without such a prefix in PRINDEAL.

Answer 7

PHP, 95 74 64 bytes

<?for($n=_;;print strrev($n))for($i=0;!$n[$i]=($n[++$i]+1)%10;);

or

<?for($n=_;;print strrev($n))while($i*=!$n[$i]=($n[++$i]+1)%10);

http://php.net/bc_installation: These functions are only available if PHP was configured with --enable-bcmath.
http://php.net/gmp_installation: In order to have these functions available, PHP must be compiled with GMP support by using the --with-gmp option.

So I just implemented bcadd ... sort of. Uses underscore as separator.

Answer 8

stacked, 12 bytes

[1+out]0 ani

Try it online!

This works as follows:

[1+out]0 ani
[     ]0 ani   in an interval of 0 seconds, do:
 1+            add 1 to the counter
   out         output it

Answer 9

REXX, 34 bytes

numeric digits 39
do #=0
say #
end

(If your interpreter is set to a suitably large default precision, you may skip the numeric digits line.)

Answer 10

VBA, 157 103 bytes

The Variant / Decimal data type in VBA only allows up to 29 digits of precision. 2^128 is 39 digits long so we have to smoosh two variables together. Variant is the default for any undeclared variable so that's easy. Every time the right-hand side (a) rolls over, set it back to 0 and iterate the left-hand side (b) by 1. To handle leading zeros, we set the format to be 28 digits long the first time that a rolls over. This has a smaller max than the string method but it's well above 2^128.

Sub c()
Do
a=a+1
If a=10^28Then b=b+1:a=0:f=Replace(Space(28)," ",0)
Debug.?b &Format(a,f)
Loop
End Sub

Once it's formatted for humans, it looks like this:

Sub c()
    Do
        a = a + 1
        If a = 10 ^ 28 Then b = b + 1: a = 0: f = Replace(Space(28), " ", 0)
        Debug.Print b & Format(a, f)
    Loop
End Sub

---

Previous method using strings:
It starts with the right-most character, converts it to a number, and then keeps moving left until the result is less than 10.

Sub d()
s="1"
Do
Debug.?s
For i=Len(s)To 1Step -1
c=Val(Right(s,1))+1
s=Left(s,i-1)
If c<10Then Exit For
If i-1Then r=r &"0"
Next
s=s &c &r
r=""
Loop
End Sub

Answer 11

QBIC, 8 bytes

{n=n+1?n

Explanation:

{       Start an infinite loop
n=n+1   Increment n (starts at 0)
?n      PRINT n
        Loop closed implicitly

Runs better tan expected. QBIC, when run in QBasic 4.5 on DOSBOX handles numbers up to and including 2^128 quite well, but it has a tendency to use scientific notation for the bigger numbers.

Answer 12

Fourier, 10 bytes

(i^~io32a)

A very simple program that loops forever.

Try it on FourIDE

Note, the program on FourIDE has been modified to make it more readable: it has a delay of two seconds between each number

Answer 13

Groovy, 25 bytes

for(i=1g;;i++){println i}

Try it online!

Groovy allows numeric literals of type BigInteger or BigDecimal to be declared by using the suffix g. BigNumber types are arbitrary length/precision numbers. This code declares a BigInteger then continuously prints (with a newline) and increments it.

Answer 14

Check, 13 bytes

 >1#v
#<)##p#

Check is my new esolang. It uses a combination of 2D and 1D semantics.

Answer 15

tcl, 23

while 1 {puts [incr i]}

demo

Answer 16

8th, 31 bytes

Code

: f n:1+ dup . cr recurse ; 0 f

Answer 17

Casio Basic, 27 bytes

For 1⇒z To ∞
Print z
Next

The largest integer the fx-CP400 can store precisely is a bit over 2²⁰³², or 611 digits. Chances are it'll keep counting up to 10¹⁰⁰⁰ before overflowing, though.

Answer 18

Cubically, 12 11 bytes

R3D1R1(+0%6)

Explanation:

R3D1R1       get UP's faceval to 1
      (      open loop that can always be jumped to
       +0     add 1 to notepad
         %    print notepad
          )  loop

Answer 19

RProgN 2, 6 bytes

1]p1+{

Try it online!

Answer 20

Swift 4, 146 bytes

var a=[0];while true{var e=a.count-1;print(a.reduce("",{$0+"\($1)"}));while e>=0{a[e]+=1;if a[e]<10{break};a[e]=0;if e==0{a.insert(1,at:0)};e-=1}}

The code compiles as is from a .swift file using swiftc. The program outputs numbers in decimal form, and given enough time it will output 2¹²⁸ (and beyond).

Ungolfed (and slightly modified^a) version: Swift Sandbox.

---

^{a: Starts just shy of 1040 (larger than 2128) and ends execution at 1040 exactly.}

Answer 21

Anyfix, 6 bytes

This was intended to be a language that allowed programs to be prefix, infix, and postfix, sometimes all at once. However, because of the way it works, dyads and tryads will default to prefix and monads will default to postfix. It's quite confusing. (Inspired by Jelly and 05AB1E)

1¿"Ƥ‘»

Explanation

1¿"Ƥ‘»  Program
1         Push 1 onto the stack
 ¿       If the stack is non-empty, then look at the top of the stack off and execute the next token if that value is truthy
  "Ƥ‘"»  ComboToken:
  "      Duplicate the top of the stack
   Ƥ     Pop and print with a trailing newline
    ‘    Increment the value

Since this is written in Python, it can easily count up to way past 2 ** 16384... hehe

This language will be on TIO sometime in the future once Dennis has some time to spare.

Answer 22

><>, 15 Bytes

0>1+:n\
 \og10/

Start with zero. Add one, print the value, and then print the character at (0,1) in the codebox, which is a space. Repeat ad nauseam.

Answer 23

Implicit on TIO, 6 4 bytes

(.%ß

This requires that the input box on TIO is empty.

(.%ß
(...   « loop while top of stack truthy                       »;
 .     «  increment top of stack (read input if stack empty)  »;
  %    «  print integer                                       »;
   ß   «  print space                                         »;
       « just kidding, loop forever                           »;

Try it online!

Answer 24

TrumpScript, 117 bytes

am is 1000001
an is 1000000
As long as,an is an?;:
say am minus an
am is,am plus 1000001 minus an;!
America is great.

Try it online!

What, there was no TrumpScript submission? Well, now there is. I don't think we can golf it any further though.

Answer 25

ALGOL 68 (Genie), 58 54 bytes

BEGIN LONG LONG INT a:=0;WHILE1=1DO print(a+:=1)OD END

Try it online!

Answer 26

JavaScript (ES6), 56 Bytes, optimized from user81655

for(n=[],i=99;;)if(n[i]=-~n[i--]%10)alert(n.join``,i=99)

Answer 27

Pyt, 6 bytes

1`Đƥ⁺ł

Explanation:

1           Push 1
 `   ł      Loop while top of stack is not 0
  Đƥ        Duplicate top of stack, then print
    ⁺       Increment top of stack

Try it online!

Answer 28

Julia 0.6, 30 bytes

for i=1:big(2)^999 @show i end

Outputs lines like i = 1, i = 2. If the i = is disallowed, then for i=1:big(2)^999 println(i) end is 32 bytes. This will count to 2^999, well over the 2^128 required. You can increase that significantly with no additional bytes with big(2)^9^9 but it times out in TIO. big(2) is an arbitrary precision integer, and all math with smaller integer types promotes to arbitrary precision.

Try it online!

Answer 29

Visual Basic .NET (.NET Core), 76 bytes

Declared subroutine that takes no input, and increments then outputs i forever.

Module M
Sub Main
Dim i
Do
i+=1
Console.WriteLine(i)
Loop
End Sub
End Module

Try it online!

Answer 30

Foam, 22 bytes

0[[+1 : <#]/-\ : ~]: ~