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 listOct 6, 2026 06:08janwwwjanwwwScore: 34,177Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 16, 2026 15:20Andrew Epstein29.26CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 06:0933,8951,942,761,6971,867,009,00065,006,000251,682,816
2Oct 6, 2026 06:0934,1771,958,781,0341,866,989,00081,103,000250,441,728
3Oct 6, 2026 06:0934,1851,959,198,5801,869,151,00079,427,000250,384,384