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 22:12Taylor DettlingTaylor DettlingScore: 3,447Success
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 22:123,441227,421,050175,249,00020,910,000250,052,608
2Apr 3, 2026 22:123,447229,665,427173,555,00022,941,000250,093,568
3Apr 3, 2026 22:123,450223,607,281175,709,00020,965,000250,118,144