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 20, 2026 15:06M-RochatM-RochatError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:120309,461,063244,655,00054,274,000237,002,752line 28348416: expected FizzBuzz got EOF
2May 20, 2026 15:120314,288,525247,910,00056,977,000241,197,056line 28749824: expected Buzz got EOF
3May 20, 2026 15:120308,629,281243,347,00055,337,000234,905,600line 28198912: expected 1931055863 got EOF
4May 20, 2026 15:125,547328,500,830258,660,00057,540,000251,682,816
5May 20, 2026 15:125,551326,947,299258,607,00057,802,000251,682,816
6May 20, 2026 15:125,564326,873,335258,649,00058,522,000251,682,816
7May 20, 2026 15:125,569328,718,045258,612,00058,867,000251,682,816
8May 20, 2026 15:125,573328,927,964258,699,00058,968,000251,682,816
9May 20, 2026 15:125,577329,886,920258,642,00059,252,000251,682,816