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 22, 2026 09:23M-RochatM-RochatScore: 4,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:254,630274,738,891205,638,00058,283,000251,682,816
2May 22, 2026 09:254,632273,358,592205,647,00058,426,000251,682,816
3May 22, 2026 09:254,640276,873,724206,187,00058,318,000251,682,816
4May 22, 2026 09:254,652274,940,256205,690,00059,487,000251,682,816
5May 22, 2026 09:254,656276,185,526205,753,00059,658,000251,682,816
6May 22, 2026 09:254,658277,037,426205,875,00059,660,000251,682,816
7May 22, 2026 09:254,659274,807,604205,716,00059,895,000251,682,816
8May 22, 2026 09:254,660274,930,894205,711,00059,946,000251,682,816
9May 22, 2026 09:254,664275,470,656205,843,00060,007,000251,682,816