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 listOct 19, 2026 01:26e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 01:2701,610,487,0771,507,460,00072,919,000268,111,872line 4: expected Fizz got FizzBuzz
2Oct 19, 2026 01:2701,593,214,6821,511,480,00070,097,000268,075,008line 2: expected Fizz got FizzBuzz
3Oct 19, 2026 01:2701,591,974,2681,509,875,00070,631,000268,079,104line 3: expected Fizz got FizzBuzz