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 listApr 3, 2026 03:07Taylor DettlingTaylor DettlingScore: 3,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 03:073,491226,875,693158,200,00040,793,000250,068,992
2Apr 3, 2026 03:073,508224,792,568167,958,00031,992,000250,134,528
3Apr 3, 2026 03:073,509226,701,511192,991,0006,999,000250,040,320
4Apr 3, 2026 03:073,510226,684,794183,062,00017,005,000250,228,736
5Apr 3, 2026 03:073,510226,146,822178,173,00021,898,000250,142,720
6Apr 3, 2026 03:073,511228,084,001176,228,00023,895,000250,126,336
7Apr 3, 2026 03:073,512218,462,849192,183,0008,007,000250,044,416
8Apr 3, 2026 03:073,513224,381,286199,218,0001,001,000250,122,240
9Apr 3, 2026 03:073,515221,545,542199,368,0001,001,000250,109,952