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 03:57HattonuriHattonuriScore: 3,939Success
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 03:573,937249,611,810182,507,00041,886,000252,006,400
2Jan 5, 2026 03:573,939251,580,900178,641,00045,907,000252,002,304
3Jan 5, 2026 03:573,950250,318,161180,108,00045,027,000252,096,512