# 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

# FALSE, 86 bytes

[\100*\/$100$@\/*-0=]m:1[$100>~][0$3m;![\%1\"Fizz"]?5m;![\%1\"Buzz"]?\0=[.]?10,1+]#  Try it online! ## Explanation [\100*\/100@\/*-0=]m: Define Modulo Function [\100*\/ Divide number * 100 by the divisor to get decimals 100@/* Get truncated result -0= Subtract to get decimal, if equal to 0, then the modulo is zero and return true. If not, return false as we don't care about the result 1 Put counter on stack [100>~] Check if number is greater than 100 [0$3m;![\%1\"Fizz"]?$5m;![\%1\"Buzz"]?\0=[$.]?10,1+]# Do FizzBuzz if not [0\ Number to see if both % 3 and % 5 failed$3m;! Number % 3
[\%1\"Fizz"]? If yes, do what is in brackets
[\%1\ Set number to 1
"Fizz"]? Print Fizz
$5m;! Number % 5 [\%1\"Buzz"]? If yes, do what is in brackets [\%1\ Set number to 1 "Buzz"]? Print Buzz \0= Check if both modulo functions failed [$.]? If yes, do what is in brackets
[$Duplicate our counter so it doesn't get destroyed .]? Print the counter 10, Print ASCII character 10 (line break) 1+]# Increment counter  Could most likely be way better. # Canvas, 31 bytes Ａ２＾｛ｗ３％０≡Fizz×ｙ５％０≡Buzz×＋：？Ｏ］ｙＯ  Try it here! Okay seriously guys why is it that both ascii-art focused languages didn't already have a FizzBuzz? This uses my favourite FizzBuzz approach found in the Vyxal answer. # BRASCA, 81 bytes 1b1[x0aB:b3%0=[xzziFoooo1a0]xB:b5%0=[xzzuBoooo0A1+a]xA0=[xB:bn0]xB1+:bH1+<lo]  Try it online! There'll be an explanation coming soon. The tio link is the interpreter split over the header and footer in such a way that the program can be entered into the code box. # Mouse-83/Mouse-2002, 73 bytes 1F:(F.Z4*1+<^0A:F.3\0=["Fizz"1A:]F.5\0=["Buzz"A.1+A:]A.0=[F.!]"!"F.1+F:)$


Try it online! Yet another fizzbuzz. Polyglots both versions listed and beats the current answer. The funny thing is that I came up with this independently of the other answer and managed to use the same approach.

# Javascript, 99 bytes

This isn't a good, or small solution, but it works:

for(let i=1;i<101;i++){console.log((i%3==0&&i%5==0)?"FizzBuzz":(i%3==0)?"Fizz":(i%5==0)?"Buzz":i);}


Explanation:

for (let i=1;i<101;i++) // Loop through, until reaching 100
{
console.log(
(i%3==0 // If I is a multiple of 3
&&      // And
i%5==0  // If I is a multiple of 5
)?"FizzBuzz": // Print "FizzBuzzz"
(i%3==0)?"Fizz":  // If I isn't either of those, check whether I is a multiple of 3, if so, print "Fizz"
(i%5==0)?"Buzz" // If I isn't a multiple of 3, check whether I is a multiple of 5, if so, print "Buzz"
:i // Else, just print i
);
}


# Phooey, 53 bytes

[100+1>&<@@%3{"Fizz">&1<}&%5{"Buzz">&1<}&>{<$i>}" "<]  Try it online! Outgolfed the creator at his own language. 😏  [100 while cell is not 100 +1 increment cell >&< set fizzed flag - empty stack is zero @@ push two copies to the stack %3 set cell to cell mod 3 { if cell is not zero "Fizz" print fizz >&1< set fizzed flag } endif & pop original value from stack %5{"Buzz">&1<} repeat for buzz & pop again >{ if fizzed flag is zero <$i>           print number
}              endif
"\n"          print newline
]               end


I may make fun of the interpreter, but it is a pretty nice language.

# Myddin, 157 bytes

use std
var p=std.put
const main={
for var i=1;i<101;i++
match(i%3,i%5)
|(0,0):p("FizzBuzz\n")
|(0,_):p("Fizz\n")
|(_,0):p("Buzz\n")
|(_,_):p("{}\n",i)
;;;;}


# ThumbGolf, 49 bytes

Machine code (little endian pairs):

2100 3101 0008 dec0 d003 b908 a303 de03
004a de6a b922 a305 de03 e003 6946 7a7a
b100 de21 de3a 2964 d1eb 4770 7542 7a7a
00


Commented assembly:

        // Include the ThumbGolf wrapper macros
.include "thumbgolf.inc"
.globl main
.thumb_func
main:
// Start the counter with zero and increment first.
// It aligns better than incrementing at the bottom.
movs    r1, #0
.Lloop:
.Lthree:
// r0 = r1 % 3
movs    r0, r1
umodi   r0, 3   // udf #0300; .short 0xd003
// if r0 == 0
cbnz    r0, .Lten
// if so print "Fizz"
puts    r3      // udf #0003
.Lten:
// do the same for Buzz
// r2 = (r1 * 2) % 10, a.k.a. r1 % 5
// we do this because umod.10 is a special narrow instruction :)
lsls    r2, r1, #1
umod.10 r2      // udf #0152
cbnz    r2, .Lnum
puts    r3      // udf #0003
b       .Lnoprint

// Normally, "Fizz" and "Buzz" are 5 byte strings due to the null
// terminator, which SUCKS. This is because Thumb instructions MUST
// be 2 byte aligned, and pool loads that are not 4 byte aligned are
// annoying wide instructions.
//
// However, I have a trick up my sleeve.
//
// CBZ is encoded as so:
//    |15 14 13 12|11|10| 9| 8| 7  6  5  4  3 |2  1  0|
//    | 1  0  1  1| 0| 0| i| 1|      imm5     |  Rn   |
// Let's focus on bits 0-7, which, since ARM is little endian, appear
// first.
//
// imm5 is the offset in opcodes relative to 4 bytes after the current
// instruction (a.k.a. where the PC is for dumb reasons). Technically,
// there is a 6th bit in bit 9, but that is only for larger offsets.
//
// .Lnoprint is exactly 4 bytes after the instruction, so the offset
// is zero:
//   0 0 0 0 0 r r r
// Now, for the register argument, if we set it to r0...
//   0 0 0 0 0 0 0 0
// Behold. A free null terminator.
//
// This is great, as it not only lets us cheat a byte in Fizz, but also,
// it makes everything align perfectly so we don't need any wide adr
// instructions. We can just put Buzz at the bottom of the file and it
// will be 4 byte aligned as well.
.Lfizz:
.ascii  "Fizz"  // null terminated by cbz encoding
.Lnum:
// was r1 % 3 not zero (meaning did we not print Fizz?)
cbz     r0, .Lnoprint
// if so, print r1 as an integer
puti    r1      // udf #0041
.Lnoprint:
// putspc is a narrow instruction that prints one of 8 special characters,
// one of which includes \n.
putspc  '\n'    // udf #0072
// loop while r1 != 100
// replace with a register for variable length
cmp     r1, #100
bne     .Lloop
// return
bx      lr
.Lbuzz:
.asciz  "Buzz"



My second submission in my brand new WIP ThumbGolf language, an ISA extension to Thumb-2.

It shows off both the new I/O instructions and the modulo instructions (with the special narrow encoding for 10).

That little hack by null terminating with cbz saves a lot, and it was really fun to figure out.

As mentioned in my cat program, this can be run on ARM Linux or QEMU by linking the ThumbGolf runtime. I don't have an online interpreter yet (and I doubt I could afford hosting one lul)

• Actually, you should have based it on x86 machine code... So is ThumbGolf a RISC or a CISC? – user99151 Feb 5 at 8:05
• ThumbGolf is what I envision to be a "RISC golfing language". I am sticking to this limitation, even if it isn't gonna win any contests. – EasyasPi Feb 5 at 11:19
• As I personally find golfing languages that let you answer a complex challenge in one byte ruin the whole point of golfing. 🤷‍♂️ – EasyasPi Feb 5 at 11:26

# JavaScript: 76 bytes

for(i=1;i<101;i++)console.log(i%3<1?'fizz'+(i%5<1?'buzz':''):i%5<1?'buzz':i)


Not the best solution we have, but not the worst either... The "nested" ternary operator adds either buzz or nothing to the fizz part depending on the results of the divisibility test.

# ///, 235 bytes

/(/\/\///%/111()/\\\\(p/1\/(x/%%%1(t/xxxxxxxxxx(>p^=)=^!)=$)vvt&@ ^^!)=^=)=^^$v)v^|^^v)v1^v)av^^v)av^v)v^>(^/\(/>(>t/%&/&%(1&/1(%11@/@%11(1@/1(&p&(@p@(&/Fizz(@/Buzz(|p001(|(/0x/1\0(0p_1(0_/_(1p2(22/4(42/6(44/8(2p3(4p5(6p7(8p9(_(/=\=(==


Try it online!

There is already a /// answer, but it is pretty boring. I thought I would try to make a more algorithmic one, even though it is a little longer ;)

Ungolfed: Try it online!

# Burlesque, 72 bytes

,1 100r@{JJ3.%0=="Fizz"j.*j5.%0=="Buzz"j.***Jr&0=={vv}j{jvv}jie}m[\[Sush


Try it online!

Do you see that at the end? Sus?!? Does that mean this program is the impostor!!!

This is why I need to stop fizzbuzzing at 10pm at night. I'll explain this tomorrow if I remember how it works.

# CSASM v2.1.2.1, 325 bytes

func main:
push 1
pop $a .lbl a clf.o push$a
push 15
rem
push 0
comp
push $f.o brtrue e push$a
push 3
rem
push 0
comp
push $f.o brtrue b push$a
push 5
rem
push 0
comp
push $f.o brtrue d push$a
print.n
br c
.lbl b
push "Fizz"
print.n
br c
.lbl d
push "Buzz"
print.n
br c
.lbl e
push "FizzBuzz"
print.n
.lbl c
clf.o
inc $a push$a
push 101
comp
push $f.o brfalse a ret end  Commented and Ungolfed: func main: ; Initilize the counter in the accumulator push 1 pop$a

.lbl loop
; Reset the Comparison flag
clf.o

; $a % 15 == 0 push$a
push 15
rem
push 0
comp

push $f.o brtrue printFizzBuzz ;$a % 3 == 0
push $a push 3 rem push 0 comp ; Jump to label "printFizz" if the Comparison flag is true push$f.o
brtrue printFizz

; $a % 5 == 0 push$a
push 5
rem
push 0
comp

push $f.o brtrue printBuzz ; None of the above were true. Just print the number itself push$a
print.n
br checkCounter

.lbl printFizz
; Print "Fizz"
push "Fizz"
print.n
br checkCounter

.lbl printBuzz
; Print "Buzz"
push "Buzz"
print.n
br checkCounter

.lbl printFizzBuzz
; Print "FizzBuzz"
push "FizzBuzz"
print.n

.lbl checkCounter
; Clear the Comparison flag
clf.o

inc $a ;$a == 101
push $a push 101 comp push$f.o

; Keep looping until the above is false
brfalse loop
ret
end
$$$$


# Pxem, Filename: 96 81 bytes + Content: 0 bytes = 96 81 bytes.

Thanks, Neil, for providing a workaround for -15 bytes!

• Filename (some are escaped): \020.z.t.m\005.%\001.yXXbuzz.a.m\003.%\001.yXXfizz.a.c.c.z.m\017.-.nXX@.a.c@.z.pXX.a.s\n.o.m\001.+.ct.a
• Content: empty.

Try it online! (with pxem.posixism)

XX.z
.a\020.zXX.z # push 16; while :; do
.a.tXX.z # heap = pop!
.a.m\005.%\001.yXXbuzz.aXX.z # while 1>heap%5; do push "buzz"; break; done
.a.m\003.%\001.yXXfizz.aXX.z # while 1>heap%3; do push "fizz"; break; done
.a.c.c.z.m\017.-.nXX@.aXX.z # if empty?; then print(heap-15); push "@"; fi
# this is how while empty?; do something; done works:
# ".c.c.z bla bla bla .a"
# NOTE: Fail on pxemi dot 7z and RPxem
# They need some patches before installing
# Implementation needs to be document-compliant
# PS. RPxem v0.0.7 fixed dotC
.a.c@.z.pXX.aXX.z # if top!="@"; then print pop all!; fi
.a.sXX.z # pop!
.a\n.oXX.z # print "\n"
.a.m\001.+XX.z # push heap; add one to it
.a.ct.aXX.z # break if equal to 116
.a


• In Pxem, unlike other stack-based languages, subtraction and division does NOT rely on positions of two items; .- does push(abs(pop-pop)), .$ and .% stand for x=pop; y=pop; push(int(x>y?x/y:y/x)) and x=pop; y=pop; push(int(x>y?x%y:y%x)) respectively. Thus, when you try to do something like 13/17 or 13%17, you need to check which are greater first. • To avoid the specification, the program loops from 16 to 115. ## Old version 1 • To work around that division, could you not loop from 16 to 116, but subtract 15 before printing? – Neil Mar 20 at 21:57 • @Neil thank you! – tail spark rabbit ear Mar 21 at 0:14 # Stax, 21 bytes åS╬╕▌≡º$)ö;▀├Xè¶XΔ£≈♀


Run and debug it

Not sure why recursive's solution from the tutorial hasn't been posted here yet. Probably the most minimal fizzbuzz possible in stax.

## Excel, 82 79 Bytes

=LET(x,ROW(1:100),a,IF(MOD(x,3),"","Fizz")&IF(MOD(x,5),"","Buzz"),IF(a="",x,a))


This wasn't valid when the question was asked.

# M4, 115 bytes

Also TIL that ifelse can have more than four arguments.

define(f,ifelse($1,101,,ifelse(eval($1%15),0,fizzbuzz,eval($1%5),0,buzz,eval($1%3),0,fizz,$1) f(incr($1))')')f(1)


Try it online!

# M4, 143 bytes, SUSv2-compatible.

define(f,ifelse($1',101,,g($1',ifelse(eval($1%3),0,fizz)'ifelse(eval($1%5),0,buzz))
f(incr($1))')')define(g,ifelse(len($2),0,$1,$2)')f(1)


Try it online!

I am not familiar with M4, but I tried some bests. What quotations can be removed?

dnl def f(n): return "" if n==101 else g(n,("fizz" if n%3==0 else "")+("buzz" if n%5==0 else "")+"\n"+f(n+1))
define(f,ifelse($1',101,',g($1',ifelse(eval($1%3),0,fizz)'ifelse(eval($1%5),0,buzz))
f(incr($1))')')dnl dnl def g(n,s): return n if len(s)==0 else n define(g,ifelse(len($2),0,$1,$2)')dnl
f(1)


# Scala, 103 94 bytes

for{i<-1 to 100;s=(if(i%3==0)"Fizz"else"")+(if(i%5==0)"Buzz"else"")}println(if(s=="")i else s)


thx @Ben (shortened by 9 bytes)

• You can save 9 bytes by using a for comprehension: for{i<-1 to 100;s=(if(i%3==0)"Fizz"else"")+(if(i%5==0)"Buzz"else"")}println(if(s=="")i else s) – Ben Oct 2 '15 at 20:57

# Python 2, 72 bytes

for x in range(100):print('Fizz'*(x%3>1)+'Buzz'*(x%5>3)or str(x+1))+'\n'


Not as clever as feersum's solution, but it avoids casting exec magic.

EDIT: with just two more parentheses, it works in Python 3 AND Python 2:

for x in range(100):print(('Fizz'*(x%3>1)+'Buzz'*(x%5>3)or str(x+1))+'\n')


# APL, 56 50 bytes

⊣{1+⍵⊣⎕←∊2↑((0=3 5|⍵)/'Fizz' 'Buzz'),''(⍕⍵)}⍣100⊢1


Note: The very first ⊣ should suppress output in GNU APL. Replace it with → to get correct results in Dyalog, etc, or with portable assignment to some variable X← adding one byte.

# A+, 51 bytes

(x←100)do↓⊃2↑((0=3 5|1+x)/4⊂'FizzBuzz'),⌽2↑<1↓⍕1+x;

• These seem quite different, so why not put them in different answers? – Martin Ender Nov 9 '15 at 7:47
• While I wouldn't call A+ a “trivial variant,” it's a direct derivative of APL and I think any solution in one would translate to similar byte count in another. Also, I just updated it making the answers work exactly the same way. – user46915 Nov 9 '15 at 9:22

# ShapeScript, 57 bytes

0'1+0?3%1<"Fizz"*1?5%1<"Buzz"*+"#0?"1?_1<*!@"
"@'554***!#


Try it online!

### How it works

0          Push 0 (accumulator).
'          Push a string that, when evaluated, does the following:
1+         Increment the accumulator.
0?         Push a copy.
3%1<       Check if the remainder of its division by 3 is zero.
"Fizz"*    Push "Fizz" for True, "" for False.
1?         Push another copy of the accumulator.
5%1<       Check if the remainder of its division by 5 is zero.
"Buzz"*    Push "Buzz" for True, "" for False.
+          Concatenate the potential fizzes and buzzes.
"          Push a string that, when evaluated, does the following:
#          Discard the topmost stack item.
0?         Push a copy of the item below it (accumulator).
"
1?         Push a copy of the concatenation.
_1<        Check if its length is zero.
*!         Execute "#0?" once for True, zero times for False.
@          Swap the generated output with the accumulator.
"          Push "\n".
"
@          Swap it with the accumulator.
'
554**      Push 5 * 5 * 4 = 100.
*!         Execute the '...' string 100 times.


# Javascript ES6, 77 chars

"\n".repeat(100).replace(/(?=\n)/g,(m,i)=>(++i%3?m:"Fizz")+(i%5?m:"Buzz")||i)


Test:

"\n".repeat(100).replace(/(?=\n)/g,(m,i)=>(++i%3?m:"Fizz")+(i%5?m:"Buzz")||i) == document.querySelector("pre").textContent

• Here's my ES6 attempt, with parts stolen from yours (89 chars): "0".repeat(99).split(0).map((m,i)=>{return(++i%3?m:"Fizz")+(i%5?m:"Buzz")||i}).join("\n") – starbeamrainbowlabs Jan 7 '16 at 6:48
• @starbeamrainbowlabs, why do you use {return ...} instead of expression? – Qwertiy Jan 7 '16 at 10:21
• Because I couldn't get the expression to work :( – starbeamrainbowlabs Jan 7 '16 at 16:20
• Save a byte by using template strings + literal newline at front. – Mama Fun Roll Jan 29 '16 at 0:34

# Elixir, 182 bytes

import Stream
f=fn(n)->(zip(cycle(["","","fizz"]),cycle(["","","","","buzz"]))|>zip(iterate(1,&(&1 + 1)))|>map(fn{{"",""},n}->n
{{p,o},_}->p<>o end))|>take(n)|>Enum.each(&IO.puts/1)end


LiveDemo

Calling: f.(100)

# ///, 229 bytes

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

• Out-golfed – Esolanging Fruit May 15 '17 at 2:58
• @Challenger5 Well done. – Leaky Nun May 15 '17 at 2:59
• @LeakyNum I have A CJam script that finds common substrings in the input. It's useful for /// golfing. – Esolanging Fruit May 15 '17 at 5:55

## JavaScript (using external library) (90 bytes)

x=>_.Range(1,100).Select(x=>x%3==0?(x%5==0?"FizzBuzz":"Fizz"):x%5==0?"Buzz":x).WriteLine()


Code explanation: Creates a range starting at 1 and extending 100 elements. Select maps the item according to the predicate. First check if divisible by 3, if so check if divisible by 5. If so, select "FizzBuzz", else select "Fizz". Otherwise,check if divisible by 5. If so, select "Buzz", else just select the number. WriteLine is built into the library, and it writes each element on its own line

# DUP, 76 bytes

[$$3/%[]['F,'i,'z,'z,]?\5/%[]['B,'u,'z,'z,]?*[.][]?10,]c:0[100<][1+c;!]# Explanation of program flow, code blocks: DUP has two default truth values: -1 (true, all bits set) and 0 (false, no bits set). For conditional evaluations every nonzero value is accepted as true, comparisons themselves lead to either -1 or 0. DUP has two conditional expressions, if-then-else and a while loop: [execute if not false][execute if false]?. E.g. 1['t,]['f,]? prints t to STDOUT, because 1 is not false. [condition][execute while not false]#. E.g. 5[0>][.1-]# prints the numbers 5,4,3,2,1 to STDOUT. The condition block tests the top stack value if it’s greater than 0, the execute block prints the number and decrements it. The condition that’s checked is always the topmost stack element, which gets popped off the stack during the check. [$$3/%${dup,dup,push 3, moddiv, pop, dup} [] {if condition true do nothing} ['F,'i,'z,'z,]? {if condition false print Fizz} \5/%$                               {swap, push 5, moddiv, pop, dup}
[]                                  {if condition true do nothing}
['B,'u,'z,'z,]?                   {if condition false print Buzz}
*                                   {mul}
[$.] {if condition true dup, print to STDOUT} []? {if condition false do nothing} 10, {push 10, print char to STDOUT (newline)} ]c: {define function c} 0 {push 0} [$100<]                                 {while dup < push 100 true}
[1+c;!]#                         {do push 1, add, execute function c}


Step by step:

instruction             stack
0                       0
[
$0,0 100 0,0,100 < 0,-1 ] 0 [ 1 0,1 + 1 increment counter c; 1,0 0=start address of function c ! execute c [$$3 1,1,1,3 / 1,1,1,0 mod,div operator (n mod 3, n div 3) % 1,1,1 /% → mod$                       1,1,1,1         result of n%3 used as flag for later check
[]                      1,1,1           condition true→do nothing
['F,'i,'z,'z,]?                         skipped
\                       1,1,1           swap top and 2nd stack elements
5                       1,1,1,5
/                       1,1,1,0         mod,div operator
%                       1,1,1           /% → mod
$1,1,1,1 n%5 flag [] 1,1,1 condition true → do nothing ['B,'u,'z,'z,]? skipped * 1,1 multiply %3 and %5 flags, result is only >0 if neither %3 nor %5 are 0. [ 1 if condition (flag)>0$                      1,1             dup
.]                    1               print number to STDOUT: '1'
[]?                                     skipped

back to while loop

[
\$                       1,1
100                     1,1,100
<                       1,-1
]                       1
[
1                       1,1
+                       2               increment counter
c;                      2,0             0=start address of function c
!                       execute c

...


A full description of all operators and program flow can be found at my GitHub repository, together wtih my Julia interpreter of DUP.

An online Javascript implementation showing useful debug information can be found here.

A rather terse introduction can be found on the esolangs.org DUP page.

# S.I.L.O.S, 141 bytes

lbla
a+1
c=1-(a%3)*(a%5)
if c b
printIntNoLine a
lblb
c=(a%3)
if c d
print Fizz
lbld
c=(a%5)
if c c
print Buzz
lblc
printLine
b=100-a
if b a


Try it online!

Unfortunately SILOS is incredibly verbose, and an interpreter bug cost me a few extra bytes, but I think SILOS is "superior" only to scratch in this challenge.

# Fourier, 81 bytes

|Fizz|F|Buzz|B1~i100(i~X%15{0}{1~XFB}X%5{0}{1~XB}X%3{0}{1~XF}X{i}{Xo}10ai^~i)


Try it on FourIDE

Who knew such a simple task would yield such a mammoth of a program!

Pseudocode of the program:

Function F {
Print "Fizz"
}

Function B {
Print "Buzz"
}

i = 1
While i != 100
X = i
If X % 15 == 0
X = 1
Function F
Function B
End if
If X % 5 == 0
X = 1
Function B
End If
If X % 3 == 0
X = 1
Function F
End If
If X == i
Print X
End if
Print "\n"
i += 1
End while

• you say function a in the ungolfed, do you mean function F? – Destructible Lemon May 15 '17 at 23:39
• also I don't think you get to call it mammoth if it fits on screen in one line, and the challenge actually isn't that simple – Destructible Lemon May 15 '17 at 23:40

## ///, 209 208 bytes

/I/
EFizz
//H/FizzE//G/
Fizz
//E/Buzz
/1
2G4I7
8GE11G13
14
H16
17G19I22
23GE26G28
29
H31
32G34I37
38GE41G43
44
H46
47G49I52
53GE56G58
59
H61
62G64I67
68GE71G73
74
H76
77G79I82
83GE86G88
89
H91
92G94I97
98GBuA

• is it just me or is some of this redundant? there isn't much point in shortening Buzz to BuC if the bytes saved by that in general are less than the bytes added – Destructible Lemon May 15 '17 at 4:34

# Micro, 72 bytes

:i{i1+:i"":d
i3/i3%=if("Fizz":d,)
i5/i5%=if(d"Buzz"+:d,)
d:\i100=if(,a)}


# Python 2, 106 bytes

for n in range(1,101):
a="Fizz"*int(n%3==0)+"Buzz"*int(n%5==0)
if a=="": print n
else: print a


Try it online!