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:05M-RochatM-RochatScore: 4,714Success
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:074,689279,481,444208,769,00058,536,000251,682,816
2May 22, 2026 09:074,689277,394,226208,811,00058,471,000251,682,816
3May 22, 2026 09:074,695276,918,073208,847,00058,773,000251,682,816
4May 22, 2026 09:074,714279,786,567208,878,00059,860,000251,682,816
5May 22, 2026 09:074,714277,918,040208,878,00059,853,000251,682,816
6May 22, 2026 09:074,717278,171,966208,898,00060,009,000251,682,816
7May 22, 2026 09:074,718278,207,817208,891,00060,059,000251,682,816
8May 22, 2026 09:074,723279,664,301208,945,00060,287,000251,682,816
9May 22, 2026 09:074,729283,046,274208,849,00060,713,000251,682,816