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 listOct 17, 2026 00:58highload-churnerhighload-churnerScore: 1,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 01:011,00466,376,98136,269,00020,979,000249,872,384
2Oct 17, 2026 01:011,00566,496,09736,363,00020,978,000249,884,672
3Oct 17, 2026 01:011,00767,046,36436,392,00021,046,000249,896,960
4Oct 17, 2026 01:011,00766,469,05236,342,00021,068,000249,884,672
5Oct 17, 2026 01:011,00866,532,31136,415,00021,064,000249,880,576
6Oct 17, 2026 01:011,01067,235,87336,390,00021,226,000249,876,480
7Oct 17, 2026 01:011,01066,776,66636,380,00021,239,000249,888,768
8Oct 17, 2026 01:011,01066,628,52136,582,00021,042,000249,880,576
9Oct 17, 2026 01:011,01767,059,13436,718,00021,257,000249,880,576