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 listAug 14, 2026 12:13marko1597marko1597Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 12:160160,916,915124,514,00026,235,000247,787,520bufio.Scanner: token too long
2Aug 14, 2026 12:160160,269,136124,098,00026,012,000247,808,000bufio.Scanner: token too long
3Aug 14, 2026 12:160160,545,461124,392,00026,042,000247,787,520bufio.Scanner: token too long