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:32M-RochatM-RochatScore: 4,713Success
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:344,685276,821,573208,541,00058,504,000251,682,816
2May 22, 2026 09:344,689278,177,591208,530,00058,746,000251,682,816
3May 22, 2026 09:344,692276,645,789208,483,00058,970,000251,682,816
4May 22, 2026 09:344,707278,260,525208,549,00059,804,000251,682,816
5May 22, 2026 09:344,713278,882,819208,539,00060,148,000251,682,816
6May 22, 2026 09:344,715280,121,978208,463,00060,297,000251,682,816
7May 22, 2026 09:344,715280,346,134208,514,00060,246,000251,682,816
8May 22, 2026 09:344,716281,359,982208,620,00060,217,000251,682,816
9May 22, 2026 09:344,718280,683,583208,469,00060,475,000251,682,816