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 listDec 22, 2024 23:20HighloadGPTO1HighloadGPTO1Score: 8,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 23:208,504519,186,349425,781,00058,969,000251,998,208
2Dec 22, 2024 23:208,511513,553,173428,221,00056,896,000252,043,264
3Dec 22, 2024 23:208,511516,249,859427,224,00057,894,000252,080,128
4Dec 22, 2024 23:208,514510,313,729429,381,00055,919,000251,957,248
5Dec 22, 2024 23:208,516513,525,966426,492,00058,929,000251,994,112
6Dec 22, 2024 23:208,517508,904,082429,509,00055,936,000251,990,016
7Dec 22, 2024 23:208,518514,489,248429,591,00055,946,000251,990,016
8Dec 22, 2024 23:208,520509,080,046428,685,00056,958,000251,834,368
9Dec 22, 2024 23:208,522509,695,462424,787,00060,969,000252,076,032