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 listDec 26, 2024 17:24Joad NacerJoad NacerScore: 4,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 17:244,543279,758,079192,974,00065,991,000252,100,608
2Dec 26, 2024 17:244,546284,506,000209,106,00050,025,000252,100,608
3Dec 26, 2024 17:244,550285,671,035204,283,00055,076,000252,059,648