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 3, 2026 02:36Taylor DettlingTaylor DettlingScore: 3,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 02:363,901247,310,956182,474,00039,885,000251,846,656
2Apr 3, 2026 02:363,903249,140,081176,580,00045,890,000251,850,752
3Apr 3, 2026 02:363,903246,619,653175,595,00046,892,000251,932,672