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:20KeefeKeefeScore: 7,252Success
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:207,248439,373,677390,186,00022,952,000250,028,032
2Feb 1, 2025 15:207,249438,457,568390,246,00022,955,000250,036,224
3Feb 1, 2025 15:207,250443,592,125395,220,00018,010,000250,060,800
4Feb 1, 2025 15:207,250438,993,208391,310,00021,961,000250,048,512
5Feb 1, 2025 15:207,252441,132,317392,382,00020,966,000250,044,416
6Feb 1, 2025 15:207,256438,819,209390,610,00022,977,000250,032,128
7Feb 1, 2025 15:207,263442,109,187392,995,00020,999,000250,048,512
8Feb 1, 2025 15:207,269439,830,388390,352,00023,960,000250,048,512
9Feb 1, 2025 15:207,302442,678,392393,272,00022,957,000250,007,552