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 08:41HattonuriHattonuriScore: 4,075Success
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 08:413,961255,304,628178,255,00047,534,000254,193,664
2Jan 5, 2026 08:393,988255,300,504181,438,00045,857,000254,095,360
3Jan 5, 2026 08:394,074254,685,503180,399,00051,827,000252,514,304
4Jan 5, 2026 08:414,075258,757,935190,429,00041,874,000252,256,256
5Jan 5, 2026 08:394,251262,783,437181,213,00061,072,000252,776,448
6Jan 5, 2026 08:414,265268,755,728174,060,00069,023,000252,780,544