Search
JavaScript (Node.js), 35 32 25 bytes -7 bytes thanks to @celtschk with(process)kill(pid,11) Try it online!
Python 2, 13 bytes exec'+1'*5**9 Try it online! No idea why this works. Something in the Python expression parser?
C, 5 bytes main; This exploits the fact that uninitialised globals live in the .bss section, and that section is not executable. So any attempt to execute code there, regardless of content, wil...
Canvas, 24 bytes zz＋¹┘％！＊ ‾U｛ŗ３Fi⁸５Bu⁸＋ｎＯ Try it here! Explanation (ASCII-fied for better monospacing): zz+¹┘%!* Helper function ⁸; Expects stack to be [modulo, string] zz+ append "z...
Rust 1.0.0, 58 53 52 37 bytes fn a(){#[no_mangle]static mmap:u8=0;}
Challenge Cause the currently running program to receive the SIGSEGV signal (on Linux or other *nix systems) as fast as possible. What it does with the signal doesn't matter as long as it receives...
Code golf, being about exploiting things, often brings about many questions about edge cases. Since we don't want each challenge to have to deal with all problems again and again, it makes sense to...
With equally great hesitation, I'll also throw my hat in the ring if Jo King does not respond. (If he does, I'd rather Chris be the second moderator.) I was on the PPCG SE site for a relatively lo...
goruby, 1 byte f Okay, so that's a bit unfair. 😂 The definition of f from golf_prelude.rb (which is what goruby embeds) is quite golfy in itself: def f(m = 100) 1.upto(m){|n|puts'FizzBuzz ...
I also endorse the nomination for Jo King. However, they have yet to accept the nomination, leaving us with zero viable nominations as of current writing. So, with great hesitation, I put my name f...
Regarding because the vast majority of all programs that were posted & highly up-voted there won't even compile on the most basic, compliant compiler for that language. Code Golf allows f...
C (gcc), 113 Bytes i;main(){while(i++<100){char*h[]={"%d "," "},**p=h;i%3||(*p++="Fizz%2$s");i%5||(*p="Buzz ");printf(*h,i,h[1]);}} This compiles with several warnings, but no errors. Here'...
If there exists something (reasonable) that can run it, it's valid. This includes obscure, non-standards-compliant compilers (though this should be specified in the answer if needed). So any poste...
Code Golf seems like a fun idea to me, since I'm a programmer by trade and "language lawyer" nerd as a hobby. But every time I checked the code golf site on SE, I dismissed it as nonsense, because...
Japt -R, 28 bytes Lõ@"Fizz"pXv3)+"Buzz"pXv5)ªX I spent a long time playing with wizardry string/array slicing. It did not work out. This solution just repeats "Fizz" and "Buzz" if divisible. T...
Python 3, 35 bytes f=lambda x,i=1:x>0and-~f(x-1/i,i+1) Try it online! Subtracts each 1/i in turn from the initial value until the result is no longer positive.
JavaScript (Node.js), 64 bytes for(n=0;101>++n;)console.log([['Fizz'][n%3]]+[['Buzz'][n%5]]||n) Try it online!
Vyxal Hj, 10 bytes ƛ₍₃₅kF½*∑∴ Try it Online! Vyxal has gotten a whole lot better since first posting this. Explained Very simply, this is: for each item in the range [1, 100], create the lis...
Could it be possible to change the amount by which an upvote changes the rep? For example, a sandbox vote could be 1 rep, meaning that if you had a good idea you would still get rep, but it wouldn'...
The task Output the first 100 elements of the infamous FizzBuzz sequence. How? The FizzBuzz sequence is the sequence of decimal integers from 1 to 100 inclusive, but: If the integer is divisi...
AppleScript, 264 bytes Sue me. It works. set n to text returned of (display dialog "" default answer "") as number set o to "" repeat with i from 1 to n repeat (n-i) times set o to o...
AppleScript, 178 bytes set n to text returned of (display dialog "" default answer "") as number set k to 0 set h to 0 repeat set k to k + 1 set h to h + (1 / k) if h >= n then exit repea...
