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 19:08Taylor DettlingTaylor DettlingScore: 3,911Success
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 19:083,907248,022,644197,709,00024,963,000250,036,224
2Apr 3, 2026 19:083,911256,759,537201,954,00020,995,000250,048,512
3Apr 3, 2026 19:083,919255,533,878202,460,00020,944,000250,036,224