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:02M-RochatM-RochatScore: 4,781Success
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:044,750279,965,390212,316,00058,467,000251,682,816
2May 22, 2026 09:044,752281,100,864212,337,00058,554,000251,682,816
3May 22, 2026 09:044,757285,518,334212,337,00058,828,000251,682,816
4May 22, 2026 09:044,780284,693,159212,394,00060,119,000251,682,816
5May 22, 2026 09:044,781283,572,915212,406,00060,120,000251,682,816
6May 22, 2026 09:044,783284,376,029212,385,00060,276,000251,682,816
7May 22, 2026 09:044,783281,946,476212,366,00060,320,000251,682,816
8May 22, 2026 09:044,788282,530,491212,436,00060,493,000251,682,816
9May 22, 2026 09:044,788282,211,982212,401,00060,527,000251,682,816