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:12Taylor DettlingTaylor DettlingScore: 3,904Success
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:123,899245,886,842199,340,00022,924,000250,212,352
2Apr 8, 2026 22:123,904242,919,991200,552,00021,950,000250,322,944
3Apr 8, 2026 22:123,910248,735,313201,903,00020,990,000250,245,120