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:20M-RochatM-RochatScore: 4,701Success
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:224,678276,463,332207,887,00058,800,000251,682,816
2May 22, 2026 09:224,689277,531,672207,863,00059,411,000251,682,816
3May 22, 2026 09:224,691277,587,072207,875,00059,533,000251,682,816
4May 22, 2026 09:224,701277,254,210208,134,00059,879,000251,682,816
5May 22, 2026 09:224,701280,349,239207,991,00060,013,000251,682,816
6May 22, 2026 09:224,702277,264,239207,990,00060,053,000251,682,816
7May 22, 2026 09:224,705279,830,293207,964,00060,268,000251,682,816
8May 22, 2026 09:224,710280,277,830208,054,00060,427,000251,682,816
9May 22, 2026 09:224,711279,602,733208,021,00060,558,000251,682,816