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 16, 2026 09:54Mark KorneichikMark KorneichikScore: 991Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 16, 2026 15:20Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 09:5898766,725,36234,975,00021,317,000249,884,672
2Oct 16, 2026 09:5898866,796,76234,988,00021,342,000249,909,248
3Oct 16, 2026 09:5898966,852,63935,072,00021,312,000249,868,288
4Oct 16, 2026 09:5899067,054,28835,191,00021,258,000249,856,000
5Oct 16, 2026 09:5899166,952,18435,125,00021,396,000249,888,768
6Oct 16, 2026 09:5899367,646,38535,055,00021,559,000249,909,248
7Oct 16, 2026 09:581,908119,281,75155,568,00053,240,000250,175,488
8Oct 16, 2026 09:581,932123,530,16355,668,00054,465,000250,187,776
9Oct 16, 2026 09:581,954121,975,75457,319,00054,075,000250,204,160