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 06:17highload-churnerhighload-churnerScore: 990Success
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 06:1998665,523,04035,255,00020,984,000249,888,768
2Oct 17, 2026 06:1998865,401,22835,755,00020,615,000249,892,864
3Oct 17, 2026 06:1998865,441,96835,316,00021,037,000249,884,672
4Oct 17, 2026 06:1998965,439,46735,301,00021,081,000249,896,960
5Oct 17, 2026 06:1999065,502,55735,330,00021,112,000249,864,192
6Oct 17, 2026 06:1999065,570,29535,326,00021,122,000249,880,576
7Oct 17, 2026 06:1999165,724,47635,262,00021,266,000249,872,384
8Oct 17, 2026 06:1999365,764,12035,296,00021,338,000249,884,672
9Oct 17, 2026 06:1999465,786,93535,314,00021,355,000249,888,768