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 05:33Josu San MartinJosu San MartinScore: 5,475Success
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 05:335,208335,535,538225,871,00070,959,000247,406,592
2Jan 5, 2026 05:335,475348,714,433226,769,00085,289,000247,418,880
3Jan 5, 2026 05:335,913364,394,461224,705,000112,352,000247,468,032