High throughput Fizz Buzz
codegolf.stackexchange.com
Fizz Buzz is a common challenge given during interviews. The challenge goes something like this: Write a program that prints the numbers from 1 to n. If a number is divisible by 3, write Fizz inst...

I’ve spent months working on this program. I’ve long thought that “how fast can you make a FizzBuzz” would be a really interesting question for learning about high-performance programming, and when I subsequently saw this question posted on CGCC, I pretty much had to try.

This is so beautiful 🥹

edit: outjerked yet again https://codegolf.stackexchange.com/a/269772

  • enemenemu@lemm.ee
    26·
    11 hours ago

    Why did you post that implementation and not David Frank’s with 1.7 Terrabit/s ?

    • fxomt@lemmy.dbzer0.comOP
      9·
      11 hours ago

      I saw it before that one, and by that time i already posted. I think deleting and reposting is a little weird so I guess I’ll have to make due X)

      I’ll mention it in the post body though, thanks lol

        • fxomt@lemmy.dbzer0.comOP
          1·
          6 hours ago

          I didn’t make it, sorry 😅 I found it since i like to browse codegolf (and PCJ, i also saw it before from there) and decided to upload it here because it always makes me crack up. If only i were this dedicated 😂