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 16, 2026 22:54M-RochatM-RochatScore: 5,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 22:575,745336,312,132267,861,00059,643,000251,682,816
2May 16, 2026 22:575,747336,412,475267,947,00059,638,000251,682,816
3May 16, 2026 22:575,747336,550,172267,904,00059,691,000251,682,816
4May 16, 2026 22:575,749336,515,362267,944,00059,762,000251,682,816
5May 16, 2026 22:575,749336,555,382267,871,00059,871,000251,682,816
6May 16, 2026 22:575,750336,648,488267,924,00059,838,000251,682,816
7May 16, 2026 22:575,752337,131,095268,731,00059,189,000251,682,816
8May 16, 2026 22:575,753338,597,818267,946,00060,029,000251,682,816
9May 16, 2026 22:575,759339,516,154267,960,00060,341,000251,682,816