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:22Taylor DettlingTaylor DettlingScore: 3,779Success
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:223,775251,181,751193,263,00021,916,000250,134,528
2Apr 3, 2026 18:223,779245,419,529197,466,00017,951,000250,052,608
3Apr 3, 2026 18:223,780242,878,939194,510,00020,947,000250,146,816