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 3, 2026 18:41Taylor DettlingTaylor DettlingScore: 3,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 18:413,735239,721,384189,913,00022,989,000250,146,816
2Apr 3, 2026 18:413,737244,076,498191,102,00021,897,000250,040,320
3Apr 3, 2026 18:413,740244,336,826195,266,00017,932,000250,056,704