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 listDec 21, 2025 13:28AnSaAnSaScore: 4,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 13:284,532284,933,812237,377,00020,945,000250,052,608
2Dec 21, 2025 13:284,534279,713,416239,492,00018,959,000250,339,328
3Dec 21, 2025 13:284,538280,706,962237,677,00020,971,000250,052,608
4Dec 21, 2025 13:284,542289,857,284238,894,00019,991,000250,290,176
5Dec 21, 2025 13:284,548288,611,009238,290,00020,937,000250,294,272
6Dec 21, 2025 13:284,559284,046,469236,888,00022,989,000250,036,224
7Dec 21, 2025 13:284,562282,801,957238,022,00022,002,000250,032,128
8Dec 21, 2025 13:284,568291,750,792236,448,00023,944,000250,281,984
9Dec 21, 2025 13:284,615290,533,278241,151,00021,922,000250,011,648