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 listFeb 1, 2025 15:18KeefeKeefeScore: 8,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 15:178,805528,417,842477,879,00023,993,000250,040,320
2Feb 1, 2025 15:188,809528,051,302484,158,00017,968,000250,077,184
3Feb 1, 2025 15:178,811533,887,401478,254,00023,962,000250,052,608
4Feb 1, 2025 15:188,811530,563,437477,289,00024,962,000250,036,224
5Feb 1, 2025 15:178,816526,140,631477,521,00024,974,000250,122,240
6Feb 1, 2025 15:189,038542,920,215493,144,00022,006,000250,044,416