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 08:59M-RochatM-RochatScore: 5,363Success
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:015,338313,576,775245,801,00058,493,000251,682,816
2May 22, 2026 09:015,339314,800,388245,648,00058,691,000251,682,816
3May 22, 2026 09:015,339313,630,577245,716,00058,655,000251,682,816
4May 22, 2026 09:015,360318,008,626245,575,00059,956,000251,682,816
5May 22, 2026 09:015,363316,644,509245,619,00060,123,000251,682,816
6May 22, 2026 09:015,364315,268,089245,671,00060,133,000251,682,816
7May 22, 2026 09:015,365318,078,832245,746,00060,059,000251,682,816
8May 22, 2026 09:015,367317,190,067245,671,00060,248,000251,682,816
9May 22, 2026 09:015,369315,339,772245,789,00060,293,000251,682,816