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 listOct 4, 2026 16:12Mark KorneichikMark KorneichikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2026 16:130256,123,138213,299,00032,392,000203,456,512bufio.Scanner: token too longstderr
2Oct 4, 2026 16:130256,323,809213,653,00032,336,000203,456,512bufio.Scanner: token too longstderr
3Oct 4, 2026 16:130256,114,803213,402,00032,275,000203,456,512bufio.Scanner: token too longstderr