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 18:17olliecrowolliecrowError
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 18:1701,751,557,872298,618,000570,888,000164,507,648bufio.Scanner: token too long
2Apr 20, 2026 18:170334,658,372231,021,00079,007,000147,456bufio.Scanner: token too long
3Apr 20, 2026 18:1717,7282,186,247,319317,854,000692,681,000116,297,728