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 22:41Taylor DettlingTaylor DettlingScore: 3,635Success
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 22:413,633237,335,878186,050,00021,005,000250,150,912
2Apr 8, 2026 22:413,635234,439,281187,155,00020,016,000250,048,512
3Apr 8, 2026 22:413,636233,369,112184,345,00022,918,000250,068,992