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 listJan 9, 2025 14:42Bohdan StorozhukBohdan StorozhukScore: 4,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 14:424,644286,852,181222,739,00041,950,000251,990,016
2Jan 9, 2025 14:424,668292,987,826217,081,00049,018,000251,899,904
3Jan 9, 2025 14:424,687297,366,149219,305,00047,848,000252,002,304
4Jan 9, 2025 14:424,710298,825,697226,547,00041,916,000252,006,400
5Jan 9, 2025 14:424,741297,512,246222,386,00047,867,000251,895,808
6Jan 9, 2025 14:424,767296,259,843227,751,00043,952,000251,994,112
7Jan 9, 2025 14:424,783298,152,615216,697,00055,922,000251,998,208
8Jan 9, 2025 14:424,802299,805,063220,757,00052,941,000251,899,904
9Jan 9, 2025 14:424,839299,491,621227,876,00047,974,000251,895,808