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:12M-RochatM-RochatScore: 4,801Success
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:164,799283,734,200252,821,00020,723,000249,909,248
2May 18, 2026 04:164,799284,736,229252,891,00020,708,000249,896,960
3May 18, 2026 04:164,799282,794,967252,846,00020,731,000249,896,960
4May 18, 2026 04:164,799282,735,668252,941,00020,644,000249,884,672
5May 18, 2026 04:164,801283,964,053252,905,00020,806,000249,892,864
6May 18, 2026 04:164,803284,800,735252,992,00020,787,000249,876,480
7May 18, 2026 04:164,804283,700,179252,917,00020,917,000249,880,576
8May 18, 2026 04:164,805283,526,699252,941,00020,954,000249,884,672
9May 18, 2026 04:164,806283,526,980252,983,00021,012,000249,888,768