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 21:41janwwwjanwwwScore: 1,482Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 29, 2026 22:13Andrew Epstein24.57CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 21:431,47594,689,71062,605,00021,513,000249,872,384
2Oct 16, 2026 21:431,47794,822,79662,572,00021,668,000249,909,248
3Oct 16, 2026 21:431,47894,835,79462,744,00021,548,000249,888,768
4Oct 16, 2026 21:431,48195,590,95662,588,00021,872,000249,872,384
5Oct 16, 2026 21:431,48296,839,25262,888,00021,640,000249,868,288
6Oct 16, 2026 21:431,48495,102,71162,913,00021,676,000249,876,480
7Oct 16, 2026 21:431,48695,357,67963,063,00021,670,000249,880,576
8Oct 16, 2026 21:431,49295,625,45863,097,00021,992,000249,888,768
9Oct 16, 2026 21:431,678106,170,49273,899,00021,761,000249,872,384