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 listJan 1, 2026 19:47HattonuriHattonuriScore: 4,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 19:474,594335,854,012172,903,00088,950,000266,895,360
2Jan 1, 2026 19:474,639339,599,063172,629,00091,802,000267,005,952
3Jan 1, 2026 19:474,736340,024,475175,331,00094,639,000266,964,992