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 23:59M-RochatM-RochatScore: 6,951Success
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 00:056,944404,677,166336,616,00059,212,000251,682,816
2May 17, 2026 00:056,947404,853,277336,351,00059,638,000251,682,816
3May 17, 2026 00:056,948404,954,270336,542,00059,507,000251,682,816
4May 17, 2026 00:056,949405,006,453336,817,00059,310,000251,682,816
5May 17, 2026 00:056,951405,571,307336,643,00059,586,000251,682,816
6May 17, 2026 00:056,955408,356,977337,002,00059,444,000251,682,816
7May 17, 2026 00:056,956407,117,150336,871,00059,624,000251,682,816
8May 17, 2026 00:056,957405,540,980336,756,00059,822,000251,682,816
9May 17, 2026 00:056,961405,746,639337,287,00059,514,000251,682,816