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 listMay 17, 2026 04:14M-RochatM-RochatScore: 7,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:187,596557,086,139284,614,000148,389,000167,391,232
2May 17, 2026 04:187,608554,345,954283,970,000149,739,000167,211,008
3May 17, 2026 04:187,617569,481,153284,003,000150,222,000167,411,712
4May 17, 2026 04:187,623559,386,028283,951,000150,608,000167,157,760
5May 17, 2026 04:187,654562,090,042283,922,000152,408,000167,305,216
6May 17, 2026 04:187,679556,593,476283,637,000154,090,000167,378,944
7May 17, 2026 04:187,687583,365,128284,072,000154,117,000166,633,472
8May 17, 2026 04:187,716553,366,763283,611,000156,233,000167,211,008
9May 17, 2026 04:187,718572,388,973283,796,000156,141,000167,342,080