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 7, 2024 23:36Joad NacerJoad NacerScore: 5,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 7, 2024 23:365,504613,797,361237,588,00076,150,000264,679,424
2Dec 7, 2024 23:365,573624,563,246236,961,00080,689,000265,150,464
3Dec 7, 2024 23:365,600638,299,646243,582,00075,594,000264,785,920