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 listMay 17, 2026 12:48M-RochatM-RochatScore: 5,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 12:555,573328,650,275255,449,00062,220,000249,896,960
2May 17, 2026 12:555,574326,580,793255,475,00062,244,000249,896,960
3May 17, 2026 12:555,576327,661,203255,517,00062,340,000249,896,960
4May 17, 2026 12:555,579328,518,893255,450,00062,599,000249,901,056
5May 17, 2026 12:555,582329,900,400255,598,00062,593,000249,884,672
6May 17, 2026 12:555,584330,069,059255,423,00062,887,000249,909,248
7May 17, 2026 12:555,587327,852,464255,502,00062,993,000249,860,096
8May 17, 2026 12:555,591327,793,799255,558,00063,164,000249,888,768
9May 17, 2026 12:555,594328,213,776255,471,00063,394,000249,888,768