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 1, 2026 21:42HattonuriHattonuriScore: 5,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:425,881362,016,509294,300,00040,902,000252,100,608
2Jan 1, 2026 21:425,881357,210,420292,317,00042,899,000252,006,400
3Jan 1, 2026 21:425,885357,465,149293,522,00041,931,000252,096,512