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:03olliecrowolliecrowError
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:030265,685,583216,863,00018,988,000234,262,528bufio.Scanner: token too long
2Apr 20, 2026 15:03017,752,34201,468,000233,472bufio.Scanner: token too long
3Apr 20, 2026 15:034,395277,259,857228,608,00021,962,000250,093,568