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 22:13Taylor DettlingTaylor DettlingScore: 3,906Success
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 22:133,897249,951,523201,236,00020,920,000250,208,256
2Apr 8, 2026 22:133,906253,486,785202,665,00019,967,000250,040,320
3Apr 8, 2026 22:133,906256,434,635202,693,00019,969,000250,298,368