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 14:12Mark KorneichikMark KorneichikScore: 1,263Success
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 14:141,26282,741,02050,534,00021,426,000249,896,960
2Oct 15, 2026 14:141,26382,567,72550,573,00021,451,000249,896,960
3Oct 15, 2026 14:141,26383,035,39550,570,00021,423,000249,892,864
4Oct 15, 2026 14:141,26383,110,46650,513,00021,485,000249,884,672
5Oct 15, 2026 14:141,26382,499,16350,511,00021,509,000249,872,384
6Oct 15, 2026 14:141,26582,634,82750,558,00021,572,000249,888,768
7Oct 15, 2026 14:141,26982,880,05550,614,00021,763,000249,901,056
8Oct 15, 2026 14:141,26983,445,11850,590,00021,774,000249,884,672
9Oct 15, 2026 14:141,27082,884,69650,656,00021,764,000249,888,768