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 listFeb 6, 2026 06:04Josu San MartinJosu San MartinScore: 3,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 06:043,890253,375,613154,125,00067,616,000244,588,544
2Feb 6, 2026 06:043,900254,200,969153,500,00068,776,000244,826,112
3Feb 6, 2026 06:043,901256,574,974153,541,00068,794,000244,785,152
4Feb 6, 2026 06:043,912262,181,892150,622,00072,338,000244,609,024
5Feb 6, 2026 06:043,913258,325,525153,324,00069,693,000244,826,112
6Feb 6, 2026 06:043,918255,572,383156,528,00066,798,000244,592,640
7Feb 6, 2026 06:043,925257,564,392155,133,00068,616,000244,584,448
8Feb 6, 2026 06:043,933263,965,741154,130,00070,059,000244,678,656
9Feb 6, 2026 06:043,947278,662,216156,307,00068,695,000244,764,672