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:10Tomislav TunkovicTomislav TunkovicScore: 1,241Success
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 18:141,23781,652,99648,971,00021,561,000249,921,536
2Sep 2, 2026 18:141,23981,836,59248,723,00021,939,000249,892,864
3Sep 2, 2026 18:141,24081,913,62449,003,00021,699,000249,913,344
4Sep 2, 2026 18:141,24182,273,27148,741,00022,044,000249,884,672
5Sep 2, 2026 18:141,24181,750,55849,002,00021,766,000249,896,960
6Sep 2, 2026 18:141,24182,073,93848,730,00022,012,000249,892,864
7Sep 2, 2026 18:141,24381,790,03548,721,00022,173,000249,896,960
8Sep 2, 2026 18:141,24682,775,02848,732,00022,291,000249,892,864
9Sep 2, 2026 18:141,24682,509,52849,035,00022,008,000249,925,632