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 20, 2026 15:04M-RochatM-RochatScore: 6,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:106,129359,545,686290,843,00058,539,000251,682,816
2May 20, 2026 15:106,136359,543,302290,951,00058,828,000251,682,816
3May 20, 2026 15:106,136360,726,963290,893,00058,878,000251,682,816
4May 20, 2026 15:106,153359,990,781290,891,00059,856,000251,682,816
5May 20, 2026 15:106,153360,020,696291,024,00059,748,000251,682,816
6May 20, 2026 15:106,157362,600,673290,967,00060,006,000251,682,816
7May 20, 2026 15:106,157360,195,707291,033,00059,921,000251,682,816
8May 20, 2026 15:106,160365,687,370290,950,00060,172,000251,682,816
9May 20, 2026 15:106,161360,999,676290,962,00060,243,000251,682,816