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:26Taylor DettlingTaylor DettlingScore: 3,766Success
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:263,766236,448,204195,690,00018,970,000250,109,952
2Apr 8, 2026 22:263,766237,061,100195,707,00018,971,000250,048,512
3Apr 8, 2026 22:263,773243,280,955194,037,00021,004,000250,122,240