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 listSep 3, 2026 12:33Tomislav TunkovicTomislav TunkovicScore: 1,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:361,08071,385,41040,686,00020,930,000249,901,056stderr
2Sep 3, 2026 12:361,08169,976,97440,826,00020,844,000249,937,920stderr
3Sep 3, 2026 12:361,08269,963,59040,804,00020,886,000249,909,248stderr
4Sep 3, 2026 12:361,08270,045,35540,682,00020,994,000249,888,768stderr
5Sep 3, 2026 12:361,08470,159,11540,816,00020,977,000249,880,576stderr
6Sep 3, 2026 12:361,08470,177,24540,816,00021,009,000249,901,056stderr
7Sep 3, 2026 12:361,08570,310,11240,617,00021,247,000249,888,768stderr
8Sep 3, 2026 12:361,08670,187,68840,690,00021,266,000249,888,768stderr
9Sep 3, 2026 12:361,08870,424,59940,799,00021,250,000249,868,288stderr