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 listSep 2, 2026 18:58Tomislav TunkovicTomislav TunkovicScore: 1,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 19:061,18776,118,96247,101,00020,609,000249,868,288
2Sep 2, 2026 19:061,18776,016,96547,093,00020,618,000249,872,384
3Sep 2, 2026 19:061,18876,188,59547,057,00020,690,000249,913,344
4Sep 2, 2026 19:061,18876,044,04447,101,00020,628,000249,884,672
5Sep 2, 2026 19:061,19176,363,26247,058,00020,875,000249,888,768
6Sep 2, 2026 19:061,19176,101,27347,221,00020,702,000249,909,248
7Sep 2, 2026 19:061,19276,190,83747,222,00020,722,000249,880,576
8Sep 2, 2026 19:061,19476,550,48847,113,00020,979,000249,901,056
9Sep 2, 2026 19:061,19476,411,19147,125,00020,954,000249,860,096