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 8, 2026 23:59Taylor DettlingTaylor DettlingScore: 3,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 23:593,439219,917,742176,034,00020,003,000250,331,136
2Apr 8, 2026 23:593,445223,678,734172,302,00024,042,000250,097,664
3Apr 8, 2026 23:593,450219,461,540175,696,00020,963,000250,040,320