Fizz Buzz Sergey Svistunov

Perform FizzBuzz on a stream of binary integers as fast as possible.

Input: 30 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: For each number n, print one line:

  • FizzBuzz if n is divisible by both 3 and 5
  • Fizz if n is divisible by 3
  • Buzz if n is divisible by 5
  • n as a decimal string otherwise
Back to listSep 2, 2026 18:14Tomislav TunkovicTomislav TunkovicScore: 1,249Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 18:191,24781,231,31449,334,00021,765,000249,896,960
2Sep 2, 2026 18:191,24783,455,72549,333,00021,750,000249,884,672
3Sep 2, 2026 18:191,24881,005,60949,335,00021,846,000249,896,960
4Sep 2, 2026 18:191,24880,890,86649,353,00021,807,000249,884,672
5Sep 2, 2026 18:191,24981,323,50849,329,00021,886,000249,913,344
6Sep 2, 2026 18:191,25082,798,70649,355,00021,951,000249,872,384
7Sep 2, 2026 18:191,25381,173,82149,348,00022,106,000249,884,672
8Sep 2, 2026 18:191,25381,648,44749,337,00022,108,000249,884,672
9Sep 2, 2026 18:191,25481,146,67949,363,00022,118,000249,884,672