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:12KeefeKeefeScore: 9,912Success
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:129,908591,466,170502,783,00061,973,000252,076,032
2Feb 1, 2025 15:129,912596,958,759506,097,00058,894,000252,039,168
3Feb 1, 2025 15:129,912596,502,903501,111,00063,886,000252,014,592