# 1, 2, Fizz, 4, Buzz

## Introduction

In our recent effort to collect catalogues of shortest solutions for standard programming exercises, here is PPCG's first ever vanilla FizzBuzz challenge. If you wish to see other catalogue challenges, there is "Hello World!" and "Is this number a prime?".

## Challenge

Write a program that prints the decimal numbers from 1 to 100 inclusive. But for multiples of three print “Fizz” instead of the number and for the multiples of five print “Buzz”. For numbers which are multiples of both three and five print “FizzBuzz”.

## Output

The output will be a list of numbers (and Fizzes, Buzzes and FizzBuzzes) separated by a newline (either \n or \r\n). A trailing newline is acceptable, but a leading newline is not. Apart from your choice of newline, the output should look exactly like this:

1
2
Fizz
4
Buzz
Fizz
7
8
Fizz
Buzz
11
Fizz
13
14
FizzBuzz
16
17
Fizz
19
Buzz
Fizz
22
23
Fizz
Buzz
26
Fizz
28
29
FizzBuzz
31
32
Fizz
34
Buzz
Fizz
37
38
Fizz
Buzz
41
Fizz
43
44
FizzBuzz
46
47
Fizz
49
Buzz
Fizz
52
53
Fizz
Buzz
56
Fizz
58
59
FizzBuzz
61
62
Fizz
64
Buzz
Fizz
67
68
Fizz
Buzz
71
Fizz
73
74
FizzBuzz
76
77
Fizz
79
Buzz
Fizz
82
83
Fizz
Buzz
86
Fizz
88
89
FizzBuzz
91
92
Fizz
94
Buzz
Fizz
97
98
Fizz
Buzz


The only exception to this rule is constant output of your language's interpreter that cannot be suppressed, such as a greeting, ANSI color codes or indentation.

## Further Rules

• This is not about finding the language with the shortest approach for playing FizzBuzz, this is about finding the shortest approach in every language. Therefore, no answer will be marked as accepted.

• Submissions are scored in bytes in an appropriate preexisting encoding, usually (but not necessarily) UTF-8. Some languages, like Folders, are a bit tricky to score--if in doubt, please ask on Meta.

• Nothing can be printed to STDERR.

• Feel free to use a language (or language version) even if it's newer than this challenge. If anyone wants to abuse this by creating a language where the empty program generates FizzBuzz output, then congrats for paving the way for a very boring answer.

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.

• If your language of choice is a trivial variant of another (potentially more popular) language which already has an answer (think BASIC or SQL dialects, Unix shells or trivial Brainfuck derivatives like Alphuck and ???), consider adding a note to the existing answer that the same or a very similar solution is also the shortest in the other language.

• Because the output is fixed, you may hardcode the output (but this may not be the shortest option).

• You may use preexisting solutions, as long as you credit the original author of the program.

• Standard loopholes are otherwise disallowed.

As a side note, please don't downvote boring (but valid) answers in languages where there is not much to golf; these are still useful to this question as it tries to compile a catalogue as complete as possible. However, do primarily upvote answers in languages where the authors actually had to put effort into golfing the code.

## Catalogue

var QUESTION_ID=58615;var ANSWER_FILTER="!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe";var COMMENT_FILTER="!)Q2B_A2kjfAiU78X(md6BoYk";var OVERRIDE_USER=30525;var answers=[],answers_hash,answer_ids,answer_page=1,more_answers=true,comment_page;function answersUrl(index){return"https://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"https://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(),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)}}
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: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="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>

• Nothing can be printed to STDERR. Is this true only when running, or also when compiling (assuming that is a separate step?) – AShelly Sep 24 '15 at 20:47
• @AShelly Only when running – Beta Decay Sep 24 '15 at 20:48
• I’m not sure I like the fact that you hardcoded the 100 into the challenge. That way, a program that just generates the expected output is a valid entry, but is not interesting for this challenge. I think the challenge should expect the program to input the number of items to output. – Timwi Sep 24 '15 at 23:28
• @Timwi While I agree that it would make it (only slightly) more interesting, I've very often seen FizzBuzz as strictly 1 to 100 (on Wikipedia and Rosetta Code, for example). If the goal is to have a "canonical" FB challenge, it makes sense. – Geobits Sep 25 '15 at 0:50
• A "vanilla fizzbuzz" sounds delicious. – Reinstate Monica -- notmaynard Sep 25 '15 at 15:12

# SQL (Oracle), 112 108 bytes

SELECT NVL(DECODE(MOD(LEVEL,3),0,'Fizz')||DECODE(MOD(LEVEL,5),0,'Buzz'),LEVEL)FROM DUAL CONNECT BY LEVEL<101


db<>fiddle here

• ''||LEVEL can be simple replaced with level – Dr Y Wit Aug 28 '19 at 14:15

# Rattle, 54 bytes

Fizz&Buzz|!sSs1S1s2P3[g+R1bs%3[0b1b^0]g%5[0b2b^0]B]100


Try it online!

This is my first answer in my new programming language! Please note: this language is not available yet on TIO, but because the interpreter itself is in Python 3, then I can still provide links to my answers. For these answers, the interpreter itself is in the header while the code for Rattle is in the actual code section. Eventually, Rattle will probably be added to TIO and the above code will run natively. If you hit run on TIO, this code will still produce the correct output.

I am also still open to suggestions for what to name my language - Rattle is simply a placeholder.

If you're interested in learning this new language, I would recommend you wait about a week. I admit, the documentation is not great yet but I'm working on improving it.

Eventually, this programming language might have a more concise way to solve this challenge.

# Explanation

Fizz&Buzz         is a hard-coded input which gets split automatically into a list
|                 signals the end of the input
!                 is a flag to disable implicit printing at EOF
sS                saves the list to memory slot 0, selects the first index of the list
s1S1              saves this to memory slot 1, selects list index 2
s2P3              saves this to memory slot 2, moves pointer to slot 3
[                 start outer loop
g+R1bs            gets value at slot 3 (initialized to zero), increments, reformats it as an integer, appends it to a buffer, saves it to slot 3
%3                takes the current value on stack and pushes the value mod 3 to stack
[0b1b^0]          if the value on stack is equal to 0, concatenates value from memory slot 1 to a buffer and nullifies the 0th element of the buffer
g%5               pushes value from slot 3 to stack, takes the value and pushes the value mod 5 to stack
[0b2b^0]          if the value on stack is equal to 0, concatenates the value from memory slot 2 to the buffer and nullifies the 0th element of the buffer if not null already
B                 if the buffer is non-empty, prints buffer
]100              end outer loop - repeats 100 times


# Mouse, 75 bytes

1I:(I.101<^0J:I.3\0=["Fizz"J.1+J:]I.5\0=["Buzz"J.1+J:]J.0=[I.!]"!"I.1+I:)$ Ungolfed: 1 I: ~ Start a loop index at 1 ( I. 101 < ^ ~ While I < 101... 0 J: ~ Begin a divisibility indicator at 0 I. 3 \ 0 = [ ~ If I % 3 == 0 "Fizz" ~ Print "Fizz" to STDOUT J. 1 + J: ~ Increment J ] I. 5 \ 0 = [ ~ If I % 5 == 0 "Buzz" ~ Print "Buzz" to STDOUT J. 1 + J: ~ Increment J ] J. 0 = [ ~ If neither 3 nor 5 divides I I. ! ~ Print I to STDOUT ] "!" ~ Print a newline I. 1 + I: ~ Increment I )$

• I'm gonna upvote if you add a cat-program. – flawr Sep 24 '15 at 20:16
• @flawr You should submit your own cat program. It will be a game of cat and mouse. – Alex A. Sep 24 '15 at 20:44
• @flawr Not quite cat, but I did add a zcat program. – Daniel Wagner Sep 25 '15 at 2:23

# Processing, 74 bytes

This is based on the Java answer by Geobits. I converted it into Processing and since Processing is similar to Java, the code is a lot similar to Geobits'.

for(int i=0;i++<100;)println((i%3<1?"Fizz":"")+(i%5<1?"Buzz":i%3<1?"":i));

• Ah, Processing. Java's willful son, stubbornly insisting that he's going to grow up to be an artist :D – Geobits Sep 24 '15 at 20:24

# awk, 62

END{for(x="Fizz";i<100;y="Buzz")print++i%15?i%5?i%3?i:x:y:x y}


Pretty sure there's no surprises here.

### Call

awk 'END{for(x="Fizz";i<100;y="Buzz")print++i%15?i%5?i%3?i:x:y:x y}'


then press Ctrl-D to signal end of input.

• I'm curious if the Ctrl-D should be included in the byte-count. Using a BEGIN block and rearranging the operators a bit adds 1 byte, i.e. BEGIN{for(x="Fizz";i<100;y="Buzz")print++i%3?i%5?i:y:i%5?x:x y} – Robert Benson May 30 '17 at 16:19

# Common Lisp, 121

(dotimes(x 100)(flet((d(n)(= 0(mod(1+ x)n))))(princ(cond((d 15)"FizzBuzz")((d 3)"Fizz")((d 5)"Buzz")(t(1+ x)))))(terpri))


(dotimes (x 100)
(flet ((d (n) (= 0 (mod (1+ x) n))))
(princ (cond ((d 15) "FizzBuzz")
((d 3) "Fizz")
((d 5) "Buzz")
(t (1+ x)))))
(terpri))


# Ruby, 59

I wanted to make a Ruby version using the slick modulo/integer-division/string-multiplication trick from feersum's Python answer (though unfortunately Ruby doesn't handle string multiplication the same way, so I spent some bytes on that):

100.times{|i|puts "#{i+1}\r"+"Fizz"*(i%3/2)+"Buzz"*(i%5/4)}


Note that this uses a carriage return \r without a newline. I don't know how portable this is; it works on my Linux and should work on Linux in general, as well as on Mac, but I'm not sure how Windows handles it. Without that, here's a 61-byte version:

100.times{|i|puts ("Fizz"*(i%3/2)+"Buzz"*(i%5/4))[/.+/]||i+1}

• You don't need space after puts. – Vasu Adari Dec 7 '15 at 3:20

# Commodore Basic, 87 bytes

1F┌I=1TO100:F=F+1:B=B+1:IFF=3T|?"FIZZ";:F=0
2IFB=5T|?"BUZZ";:B=0
3IFF>0A/B>0T|?I;
4?:N─


Or in "shifted mode" to get both lower- and upper-case letters, but with the byte values of lowercase and uppercase swapped relative to ASCII-1967 (press COMMODORE+SHIFT):

1fOi=1to100:f=f+1:b=b+1:iff=3tH?"Fizz";:f=0
2ifb=5tH?"Buzz";:b=0
3iff>0aNb>0tH?i;
4?:nE


Usual PETSCII-to-Unicode substitutions: ┌ = SHIFT+O, | = SHIFT+H, / = SHIFT+N, ─ = SHIFT+E

Commodore Basic doesn't have a "modulus" operation, so I need to use alternate methods to figure out when to print what: keeping a pair of counters turns out to be fewer bytes than dividing and checking for integer-ness. It also doesn't have a true logical "and" (despite the manual saying otherwise), so I need to do an explicit comparison against zero to decide if I should print the plain number.

• @DLosc, you can switch into "shifted mode" which gives access to both upper- and lower-case, but with the character positions reversed relative to the ASCII-1967 which people are familiar with (eg. character #65 is lowercase "a" rather than uppercase). – Mark Sep 28 '15 at 2:27

## Gol><>, 40 bytes

e2RFL5%zR"zzuB"L3%zR"zziF"lQlRoaoC|LN|;


Updated for 0.4.0! I'm still tinkering with loops and trying to figure out how to do things best, but this is looking good so far.

## Explanation

e            Push 'e', or 101
2RF ... |     Execute F for loop twice - the first time activates the loop, and the
second time updates it. This effectively makes the loop start from 1
L5%z          Push 1 if loop counter % 5 is 0, else 1
R"zzuB"       Push "Buzz" (top of stack) number of times
L3%z          Push 1 if loop counter % 3 is 0, else 1
R"zziF"       Push "Fizz" (top of stack) number of times
lQ ... |      If the stack is not empty...
lRo         Output stack
ao          Output newline
C           Continue for loop
LN            Otherwise, print loop counter with newline

;             Terminate program


As we can see, there's a lot of abuse of R, which pops the top of the stack and executes the next instruction that many times.

• That's a smart idea! Mind if I use it? – Conor O'Brien Oct 28 '15 at 12:16

# Jolf, 4233 31 bytes

Try it here! Replace ƒ with \x9f. I'm stealing ETHproduction's method of fizzbuzzing.

ƒΜz~1d|]"FizzBuzz"?%H340?%H548H


## Old version, 42 bytes

γ"Fizz"ƒΜz~1d?mτͺ35H+γζ?m|3Hγ?m|5HΖ"Buzz"H
γ"Fizz"                                     γ = "Fizz"
Μz~1d                               map 1..100 with the following function
?mτͺ35H                        if both 3 and 5 | H
+γζ                      return γ + ζ
m|3H                 else if 3 | H
γ                 return γ
?m|5H          else if 5 | H
Ζ"Buzz"    return ζ = "Buzz"
H  else return H
ƒ                                    join by newlines


I might be able to golf it down by using the dictionary in Jolf, but who would want to with such a perfect score?

# Python 2 REPL, 54

0;exec"print _%3/2*'Fizz'+_%5/4*'Buzz'or-~_;_+=1;"*100


Based on this answer by feersum. Essentially the same technique, only using Python's underscore variable to save 2 chars at the start.

• You should probably specify this answer as "Python 2 REPL", as opposed to feersum's which is a full program. – Sp3000 Mar 7 '16 at 2:26
• @Sp3000 Done and done. – Tersosauros Mar 7 '16 at 2:37

# Vim, 66, 57 56 keystrokes

i1<esc>qqYp<C-a>q98@q3Gqy:s/\d*/Fizz<CR>3j@yq@y5Gqz:s<CR>ABuzz<esc>5j@zq@z


Further golfing, and explanation on the way.

• A bit too late, but apparently this doesn't output correctly: Try it online! – user41805 May 16 '17 at 9:47

# Ruby, 827270 68 bytes

puts (1..100).map{|i|(x=(i%3<1?"Fizz":"")+(i%5<1?"Buzz":""))>""?x:i}


old solution:

(1..100).map{|i|$><<"Fizz"if f=i%3<1$><<"Buzz"if b=i%5<1
$><<i if !(f||b) puts()}  # APL, 41 bytes ⊣{⎕←∊(z,⍱/z←0=3 5|⍵)/'Fizz' 'Buzz'⍵}¨⍳100  Tested on GNU-APL (ver 1.7/980M) • Do you need the space between ' and ⍵? – Zacharý Aug 3 '17 at 20:34 • Oh, I haven't used GNU APL in a while, is the ⊣ needed, since you display directly to STDOUT? – Zacharý Aug 4 '17 at 22:15 • @Zacharý In GNU-APL monadic 'left tack' discards the value of the right argument. I read it as return nothing (since it points to left). I hope this is the correct way to phrase it. on the other hand, I do not have experience with Dyalog or a ready-setup to play with. – Ala'a Mohammad Aug 6 '17 at 18:45 • Oh, for some reason I was thinking the return value was not written to STDOUT by default. – Zacharý Aug 6 '17 at 19:05 # TeX, 304 bytes \documentclass[9pt,a4paper]{article}\pagestyle{empty}\begin{document}\count0=0\count1=0\count3=3\count5=5\loop\advance\count1 by1\count0=0 \ifnum\count1=\count3 Fizz\advance\count3 by3\count0=1\fi\ifnum\count1=\count5 Buzz\advance\count5 by5\count0=1\fi\the\count1 \ifnum\count1<100\repeat\end{document}  Somehow count0 is necessary but I didn't check whether it is zero. It works and I have no idea why. • I'm assuming that extra newline is there for a reason, but what's the reason? – Stephen Aug 20 '17 at 0:06 • @StepHen two newlines is a new paragraph – Leaky Nun Aug 20 '17 at 0:06 # AppleScript, 104102 100 bytes "" repeat with i from 1to 100 result&{"FizzBuzz",i,"Fizz","Buzz"}'s item((i^4mod 15+7)div 4)&" " end  If you run it in Script Editor, the result has "quotes" around it. If you run it with osascript, there are no "quotes", but the result ends with an extra blank line. I steal the technique from Lynn's Lua answer, where the script picks from a list of possible values to print. I use (i^4mod 15+7)div 4 to calculate the index 1, 2, 3, or 4. It's different from Lua's i^2%3+i^4%5*2+1. In AppleScript, i^4 raises i to 4th power. It returns a real, which is a floating-point number, but the value is equal to the correct integer. The values of n = i^4mod 15 with i from 1 to 15 are i = 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 n = 1 1 6 1 10 6 1 1 6 10 1 6 1 1 0  So n is 0.0 for "FizzBuzz", 1.0 for i, 6.0 for "Fizz", or 10.0 for "Buzz". This pattern continues with i from 16 to 100. I need to map the values 0.0, 1.0, 6.0, 10.0 to a list index; lists in AppleScript start at index 1. n = 0.0 1.0 6.0 10.0 (n+2)mod 7 = 2.0 3.0 1.0 5.0 (n+7)div 4 = 1 2 3 4  My 104-byte answer used (n+2)mod 7, but that mapping had 5.0 instead of 4.0, so it needed a list of 5 items, where the extra item 0, cost 2 bytes. My 102-byte answer uses (n+7)div 4. My 100-byte answer deletes 2 extra spaces. # Excel VBA, 88 Bytes Anonymous VBE immediate window function that takes no input and outputs to the VBE immediate window. For i=1To 100:o="":o=IIf(i Mod 3,o,"Fizz"):o=IIf(i Mod 5,o,o+"Buzz"):?IIf(o="",i,o):Next  Ungolfed For i=1To 100 '' iterate from 1 to 100 o="" '' reset out var at each var o=IIf(i Mod 3,o,"Fizz") '' set the out var to Fizz if i Mod 3 = 0 o=IIf(i Mod 5,o,o+"Buzz") '' append Buzz to out var if i Mod 5 = 0 ?IIf(o="",i,o) '' If out var is non-empty, output the out var '' else output i Next  ## Worksheet Version, 97 Bytes Anonymous VBE immediate window function that takes no input and outputs to the range [C1:C100] [A1:C100]=Array("=ROW()","=IF(MOD(A1,3),,""FIZZ"")&IF(MOD(A1,5),,""BUZZ"")","=IF(B1="""",A1,B1)")  Ungolfed [A1:A100]="=ROW()" [B:B]="=IF(MOD(A1,3),,""FIZZ"")&IF(MOD(A1,5),,""BUZZ"")" [C:C]="=IF(B1="""",A1,B1)"  ## Subroutine Version, 110 Bytes Declared Subroutine that takes no input and outputs to the VBE immediate window Sub F For i=1To 100 o="" If i Mod 3=0Then o="Fizz If i Mod 5=0Then o=o+"Buzz Debug.?IIf(o="",i,o) Next End Sub  • You can remove o="": and change your first iif to IIf(i Mod 3,"","Fizz") – seadoggie01 Sep 7 '18 at 20:53 • For the Subroutine version, the () after F isn't optional, and gets added in automatically. Same with the ? in debug. – Selkie Feb 26 '19 at 18:14 • @Selkie, the behavior you are describing is known as autoformatting, and it is generally accepted in this community for VBA and for all languages that exhibit autoformatting, one may post their code from before it is autoformatted. in this case, that would mean that a couple of spaces may be removed, terminal "s dropped, changing print to ? and removal of the () from the Sub declaration. I suggest that you take a look at the Tips for Golfing in VBA page for more info – Taylor Scott Feb 26 '19 at 21:30 # Forth, 107101 98 bytes : f 101 1 do i 5 mod i 3 mod if dup if i . then else ." Fizz" then 0= if ." Buzz" then cr loop ; f  Ungolfed + close Python equivalent: : f \ def f(): 101 1 do \ for i in range(1, 101): i 5 mod \ a = i % 5 # Not an actual variable, pushed onto the stack i 3 mod \ b = i % 3 if \ if b: # b is popped dup \ c = a if \ if c: i . \ print(i, end='') then else \ else: ." Fizz" \ print('Fizz', end='') then 0= \ a = (a == 0) if \ if a: ." Buzz" \ print('Buzz', end='') then cr \ print() loop ; f \ f()  Run it! • To Taylor Scott: sorry for deleting the edit. I thought adding another language would be more meaningful – Alex Apr 18 '18 at 23:25 • Alex, while this is definitely a more interesting answer you should feel free to leave multiple responses to challenges. – Taylor Scott May 16 '18 at 14:18 # Go, 130129 134 bytes package main;import."fmt";func main(){for i:=1;i<101;i++{o:="";if i%3<1{o+="Fizz"};if i%5<1{o+="Buzz"};if o==""{Print(i)};Println(o)}}  I wish i had ternary operators... Edit: @Dust pointed out that I printed to stderr so my solution actually increased in size :( Try it online! • I think this prints to STDERR which he said is not allowed. – Dust Apr 19 '18 at 19:14 • @Dust you are right, I'll have to revise – Kristoffer Sall-Storgaard Apr 20 '18 at 7:32 # 12-BASIC, 7355 50 bytes FOR I=1TO 100?"FIZZ"*!(I%3)+"BUZZ"*!(I%5)OR I NEXT  The first code golf program I've written in the language I'm creating. I should probably avoid code golf while working on it though... # Julia 1.0, 72 bytes (n->println([n,"Fizz","Buzz","FizzBuzz"][sum(n.%[1,3,5,5].<1)])).(1:100)  Not the shortest solution possible, but I like the obfuscation. Try it online! ### Explanation We apply an anonymous function (n->...) itemwise .( ) to the range 1:100. The function body does this (using sample input n=5): n.%[1,3,5,5] # Modulo n by each of these numbers [0,2,0,0] .<1 # Itemwise, is each remainder zero? [true,false,true,true] sum( ) # Count number of trues in the array 3 # This will be 4 for multiples of 15, 3 for multiples # of 5, 2 for multiples of 3, and 1 for other numbers [n,"F","B","FB"][ ] # Index (1-based) into this array "Buzz" println( ) # Print, with a newline  # Javascript, 80 bytes for(i=1;i<101;i++){console.log(i%3==0?i%5==0?"FizzBuzz":"Fizz":i%5==0?"Buzz":i)}  • To whoever downvoted this; you really should explain why. Especially considering Jey is a new contributor. – Marie Feb 27 '19 at 19:27 # SNOBOL4 (CSNOBOL4), 137121 114 bytes I X =X + 1 O =EQ(REMDR(X,3)) 'Fizz' O =O EQ(REMDR(X,5)) 'Buzz' O =IDENT(O) X OUTPUT =O O =LT(X,100) :S(I) END  Try it online! ## Explanation:  ;* uninitialized variables start as '' ;* which is coerced to 0 in computations I X =X + 1 ;* Increment X O =EQ(REMDR(X,3)) 'Fizz' ;* if X mod 3 == 0, O = 'Fizz' O =O EQ(REMDR(X,5)) 'Buzz' ;* if X mod 5 == 0, concatenate O and 'Buzz' O =IDENT(O) X ;* if O is IDENTical to the empty string, ;* set O to X OUTPUT =O ;* print O O =LT(X,100) :S(I) ;* set O to '' and if X < 100, goto I END  # Zsh, 105786866 61 bytes Try it online! for i ({1..100})(((i%3))||w=Fizz;((i%5))||w+=Buzz;<<<${w-$i})  -27 using simpler approach -10 using parameter fallback -2 thanks to @Dennis - kudos for the bash solution -5 thanks to @GammaFunction Original solution, using weird r flag... try it online for ((;i++<100;));{f=$[i%3>0?0:4] b=$[i%5>0?0:4] echo${(r:$f::Fizz:)}${(r:$b::Buzz:)}((f+b>0))||<<<$i}

• You don't need the last ; on the first line. A port to Bash takes 70 bytes, thus beating my answer. – Dennis Aug 28 '19 at 14:49
• Also, you don't need the newline before the last } (which is missing in your answer). Try it online! – Dennis Aug 28 '19 at 14:56
• the bash solution still wins for originality.. I couldn't port that crazy for expression to zsh – roblogic Aug 28 '19 at 15:01
• 61, mostly thanks to subshells – GammaFunction Oct 15 '19 at 2:03

# DIVSPL, 22 bytes

1..100
fizz=3
buzz=5


# Bash, 58 bytes

eval i={1..100}';a=([i%3]=Fizz [i%5]+=Buzz);echo ${a-$i};'


Try it online!

# Windows Batch, 149 bytes

@for /l %%N in (1 1 100)do @(set s=&set/a1/(%%N%%3^)||set s=Fizz&set/a1/(%%N%%5^)&&(if defined s (echo Fizz)else echo %%N)||call echo %%s%%Buzz)2>nul


The SET /A statements test the modulo 3 and 5 without using IF by intentionally dividing by zero and using && and || conditional command concatenation. Of course stderr must be disabled, but it still saves bytes vs an IF statement.

# Windows Batch (unusual cmd.exe configuration, and environment assumption), 166165 133 bytes

My original answer used delayed expansion, but the code to enable delayed expansion takes 32 bytes all on its own. However, some people have their cmd.exe configured to have delayed expansion enabled by default. For the small minority of people that configure cmd.exe this way, then the following is significantly shorter.

@for /l %%N in (1 1 100)do @(set 1=&set/a1/(%%N%%3^)||set 1=Fizz&set/a1/(%%N%%5^)||set 1=!1!Buzz&>nul set 1&&echo !1!||echo %%N)2>nul


Besides relying on an unusual cmd.exe configuration, it is also reliant on the absence of any environment variable names that begin with 1. This is normally safe because batch treats something like %1var% as batch parameter %1 followed by a string constant var - the trailing % would get stripped. So people are taught to never begin variable names with a digit.

# ><>, 59 bytes

0v!oo:oo"Fiz"\
1<oan?*/!?%5$\!?%3;?)*aa::::::+ o"Buzz"/$0oo


Try it online!

Prints a trailing newline

### How it works

0v...
.<... Initialises the stack with 0
.....

.....
1<................;?)*aa::::::+ Increment the counter and duplicate it a looooot
.....                           End the program if the counter is larger than 100 (10*10)

0..oo:oo"Fiz"\
.............\!?%3... Check if the counter is divisible by 3 and print Fizz if so
.....                 Also push a 0 to the stack

.......o         Swap the pushed 0 if it exists (otherwise it swaps two copies of the counter)
......./!?%5$... Check if the counter is divisible by 5 and print Buzz if so o"Buzz"/$0oo     Also push a 0 to the stack

.......... Multiply the top two values of the stack.
..oan?*... If the counter was divisible by 5 or 3 print the number
.......... Print a newline and loop around again


As time goes, the stack fills up, with an extra copy of the counter for each Fizz or Buzz (and two for FizzBuzzes). This is due to the extra copy(s) of the counter that don't end up being printed.

# Spaghetti, 522 bytes

main:0"n"goto store goto l l:100"n"goto retrieve goto areEqual"EOF"goto jumpIfTrue"n"goto retrieve 1 2 goto add"n"goto store 15"n"goto retrieve 2 goto modulus 0 goto areEqual"f"goto jumpIfTrue 3"n"goto retrieve 2 goto modulus 0 goto areNotEqual"b"goto jumpIfTrue"Fizz"1 goto print goto b t:3"n"goto retrieve 2 goto modulus 0 goto areEqual"l"goto jumpIfTrue"n"goto retrieve 1 goto print goto l b:5"n"goto retrieve 2 goto modulus 0 goto areNotEqual"t"goto jumpIfTrue"Buzz"1 goto print goto l f:"FizzBuzz"1 goto print goto l



Requires a newline at the end, cause otherwise the interpreter throws a hissy fit.

Spaghetti is a stack based language that promotes using goto extensively. That means, every single operation you use requires a goto statement along with it.

That being said, this took a while.

Commented version is at the Spaghetti examples.

Try it on the online interpreter! (Code must be pasted in)

# LolCode, 392383 353 bytes

This LolCode follows the 1.3 standard used by the lci interpreter.

Unfortunately, no online interpreter.

Not the best language to golf with, but it's fun!

Update 1: changed for loop to while loop

Update 2: removed newlines in favor of commas (soft command break)

HAI 1.3,CAN HAS STDIO?,I HAS A v ITZ 1,IM IN YR s,BOTH SAEM 0 AN MOD OF v AN 15,O RLY?,YA RLY,VISIBLE "FizzBuzz",NO WAI,BOTH SAEM 0 AN MOD OF v AN 3,O RLY?,YA RLY,VISIBLE "Fizz",NO WAI,BOTH SAEM 0 AN MOD OF v AN 5,O RLY?,YA RLY,VISIBLE "Buzz",NO WAI,VISIBLE v,OIC,OIC,OIC,BOTH SAEM v AN 100,O RLY?,YA RLY,GTFO,OIC,v R SUM OF v AN 1,IM OUTTA YR s,KTHXBYE

• Nice first post, welcome to the site! – Redwolf Programs Nov 3 '20 at 15:32