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 27, 2022 17:55Benjamin YoungBenjamin YoungScore: 426,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2022 17:55426,53624,714,198,10324,312,545,6060264,372,224
2Dec 27, 2022 17:55426,87724,739,717,39224,331,967,0380265,965,568
3Dec 27, 2022 17:55430,88425,075,777,56724,560,395,3650267,878,400