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 18, 2026 04:20M-RochatM-RochatScore: 4,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 04:244,802283,003,526253,121,00020,635,000249,872,384
2May 18, 2026 04:244,803287,426,216253,068,00020,707,000249,892,864
3May 18, 2026 04:244,803284,886,401253,088,00020,734,000249,901,056
4May 18, 2026 04:244,804283,265,780253,132,00020,702,000249,872,384
5May 18, 2026 04:244,805283,117,892253,147,00020,790,000249,896,960
6May 18, 2026 04:244,806286,192,062253,086,00020,911,000249,901,056
7May 18, 2026 04:244,809286,246,431253,109,00021,015,000249,892,864
8May 18, 2026 04:244,810283,332,128253,180,00020,992,000249,864,192
9May 18, 2026 04:244,822285,830,358254,122,00020,754,000249,896,960