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 22, 2026 02:40Taylor DettlingTaylor DettlingScore: 3,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 02:413,018193,263,380150,197,00021,883,000250,126,336
2Apr 22, 2026 02:413,020188,975,647150,286,00021,896,000250,114,048
3Apr 22, 2026 02:413,021188,709,355149,346,00022,899,000250,122,240
4Apr 22, 2026 02:413,021190,172,222150,341,00021,904,000250,142,720
5Apr 22, 2026 02:413,023190,243,512148,440,00023,909,000250,089,472
6Apr 22, 2026 02:413,026189,608,825150,560,00021,935,000250,105,856
7Apr 22, 2026 02:413,026190,146,271149,566,00022,933,000250,105,856
8Apr 22, 2026 02:413,028184,868,061153,673,00018,959,000250,118,144
9Apr 22, 2026 02:413,030192,996,228150,751,00021,963,000250,097,664