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 20, 2026 15:10olliecrowolliecrowError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:120273,988,443239,618,00021,965,000234,250,240bufio.Scanner: token too long
2Apr 20, 2026 15:1207,382,15601,145,000303,104bufio.Scanner: token too long
3Apr 20, 2026 15:124,887293,303,877255,630,00022,966,000250,306,560