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 listApr 8, 2026 21:25Taylor DettlingTaylor DettlingScore: 3,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 21:253,415217,875,806171,696,00022,959,000250,052,608
2Apr 8, 2026 21:253,427221,370,761174,303,00021,036,000250,023,936
3Apr 8, 2026 21:253,429222,040,503175,522,00019,945,000250,056,704