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,830Success
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:184,828284,384,263254,615,00020,583,000249,913,344
2May 18, 2026 04:184,828285,231,237254,584,00020,654,000249,901,056
3May 18, 2026 04:184,829286,346,418254,664,00020,634,000249,868,288
4May 18, 2026 04:184,830286,699,925254,611,00020,722,000249,896,960
5May 18, 2026 04:184,830286,801,733254,681,00020,662,000249,896,960
6May 18, 2026 04:184,833284,793,895254,579,00020,950,000249,913,344
7May 18, 2026 04:184,834284,742,463254,615,00020,948,000249,901,056
8May 18, 2026 04:184,836285,092,872254,683,00020,974,000249,901,056
9May 18, 2026 04:184,851285,835,984255,895,00020,654,000249,888,768