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 listMay 10, 2025 22:01KeefeKeefeScore: 19,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 22:0119,2113,553,957,601347,545,000747,473,00058,097,664
2May 10, 2025 22:0119,4433,480,919,191366,654,000741,572,00059,424,768
3May 10, 2025 22:0119,5603,663,674,930358,607,000756,301,00059,707,392