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 listJan 5, 2026 04:10HattonuriHattonuriScore: 3,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 04:103,926252,670,330178,825,00044,956,000254,033,920
2Jan 5, 2026 04:103,932246,504,125179,300,00044,825,000254,046,208
3Jan 5, 2026 04:103,932252,347,955180,314,00043,833,000254,042,112
4Jan 5, 2026 04:103,933247,868,070181,328,00042,841,000254,038,016
5Jan 5, 2026 04:103,933248,402,047178,371,00045,838,000254,038,016
6Jan 5, 2026 04:103,934250,360,025179,382,00044,845,000254,038,016
7Jan 5, 2026 04:103,935250,761,157177,451,00046,855,000254,033,920
8Jan 5, 2026 04:103,936248,740,069183,486,00040,885,000254,193,664
9Jan 5, 2026 04:103,938251,740,965182,551,00041,897,000254,193,664