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 17, 2026 12:54M-RochatM-RochatScore: 5,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 12:575,503324,360,997253,995,00059,723,000251,682,816
2May 17, 2026 12:575,507323,215,719254,061,00059,838,000251,682,816
3May 17, 2026 12:575,508322,844,873253,939,00060,048,000251,682,816
4May 17, 2026 12:575,509322,622,659254,038,00059,976,000251,682,816
5May 17, 2026 12:575,512325,389,498254,252,00059,962,000251,682,816
6May 17, 2026 12:575,513323,741,032254,055,00060,193,000251,682,816
7May 17, 2026 12:575,515326,350,524254,137,00060,233,000251,682,816
8May 17, 2026 12:575,515324,524,774254,043,00060,343,000251,682,816
9May 17, 2026 12:575,520325,275,988254,184,00060,497,000251,682,816