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 15, 2026 13:03Mark KorneichikMark KorneichikScore: 1,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 13:051,45793,565,17461,528,00021,577,000249,892,864
2Oct 15, 2026 13:051,45893,676,18261,569,00021,584,000249,909,248
3Oct 15, 2026 13:051,45893,519,98861,550,00021,591,000249,884,672
4Oct 15, 2026 13:051,45993,701,14061,635,00021,563,000249,876,480
5Oct 15, 2026 13:051,45993,593,27761,586,00021,623,000249,884,672
6Oct 15, 2026 13:051,46193,916,81161,630,00021,681,000249,901,056
7Oct 15, 2026 13:051,46694,105,15261,795,00021,812,000249,892,864
8Oct 15, 2026 13:051,46694,138,86261,722,00021,851,000249,876,480
9Oct 15, 2026 13:051,46794,186,53061,803,00021,871,000249,880,576