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 listOct 3, 2026 03:19Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 03:200378,472,702366,878,0001,027,0002,113,536line 0: expected FizzBuzz got n30000000 min183 max4294967214 l9 6983679 l8 697783 d3 333 d5 200 d15 66 out 249839510
2Oct 3, 2026 03:200378,376,508366,726,0001,173,0002,113,536line 0: expected FizzBuzz got n30000000 min58 max4294967184 l9 6983231 l8 700704 d3 333 d5 199 d15 66 out 249857620
3Oct 3, 2026 03:200378,036,617366,475,0001,045,0002,113,536line 0: expected 1411627399 got n30000000 min34 max4294966953 l9 6983755 l8 696577 d3 333 d5 199 d15 66 out 249871294