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 listMar 23, 2026 06:27Dominique GarmierDominique GarmierScore: 5,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 20:395,722350,430,997271,295,00054,857,000251,932,672
2Mar 22, 2026 20:395,729352,455,865274,620,00051,928,000252,080,128
3Mar 22, 2026 20:395,732355,858,261272,751,00053,950,000252,002,304
4Mar 23, 2026 06:275,741357,606,669276,336,00050,877,000251,957,248
5Mar 23, 2026 06:275,744350,763,781275,513,00051,908,000252,071,936
6Mar 23, 2026 06:275,829357,966,339271,592,00060,685,000251,899,904