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 21:36Taylor DettlingTaylor DettlingScore: 3,413Success
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 21:363,411218,825,247172,490,00021,935,000250,114,048
2Apr 8, 2026 21:363,413219,873,528173,583,00020,949,000250,171,392
3Apr 8, 2026 21:363,418224,171,071176,822,00017,981,000250,126,336