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 listAug 14, 2026 14:42Tomislav TunkovicTomislav TunkovicScore: 1,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 15:271,53195,500,07966,447,00020,868,000249,901,056stderr
2Aug 14, 2026 15:271,53296,398,15266,590,00020,781,000249,901,056stderr
3Aug 14, 2026 15:271,53296,312,46566,567,00020,792,000249,909,248stderr
4Aug 14, 2026 15:271,53395,817,35566,529,00020,878,000249,876,480stderr
5Aug 14, 2026 15:271,53397,528,55366,581,00020,849,000249,917,440stderr
6Aug 14, 2026 15:271,53496,554,75166,569,00020,869,000249,872,384stderr
7Aug 14, 2026 15:271,53796,172,24966,537,00021,127,000249,892,864stderr
8Aug 14, 2026 15:271,53795,855,19966,561,00021,092,000249,864,192stderr
9Aug 14, 2026 15:271,53896,350,13166,559,00021,131,000249,896,960stderr