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:13M-RochatM-RochatScore: 4,699Success
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:164,674278,731,631207,647,00058,785,000251,682,816
2May 22, 2026 09:164,675276,405,650207,641,00058,864,000251,682,816
3May 22, 2026 09:164,677275,854,756207,729,00058,879,000251,682,816
4May 22, 2026 09:164,698279,234,470207,849,00059,951,000251,682,816
5May 22, 2026 09:164,699277,107,693207,808,00060,087,000251,682,816
6May 22, 2026 09:164,700277,288,227207,754,00060,179,000251,682,816
7May 22, 2026 09:164,704277,836,656207,820,00060,312,000251,682,816
8May 22, 2026 09:164,707279,401,109207,716,00060,595,000251,682,816
9May 22, 2026 09:164,707277,871,937207,841,00060,461,000251,682,816