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 9, 2026 21:17highload-churnerhighload-churnerScore: 2,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:252,114131,135,27298,886,00021,660,000249,892,864
2Oct 9, 2026 21:252,139132,479,385100,353,00021,599,000249,909,248
3Oct 9, 2026 21:252,139133,196,063100,136,00021,825,000249,884,672
4Oct 9, 2026 21:252,144132,774,496100,132,00022,091,000249,880,576
5Oct 9, 2026 21:252,146133,022,593100,591,00021,786,000249,892,864
6Oct 9, 2026 21:252,148133,366,247100,176,00022,303,000249,880,576
7Oct 9, 2026 21:252,150133,204,798100,911,00021,666,000249,880,576
8Oct 9, 2026 21:252,151133,271,141100,668,00021,951,000249,901,056
9Oct 9, 2026 21:252,153152,767,901100,765,00021,998,000249,872,384