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 listOct 18, 2024 19:51Yuriy LyfenkoYuriy LyfenkoScore: 4,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2024 19:514,4281,101,256,758191,820,00060,574,000266,186,752
2Oct 18, 2024 19:514,4581,108,259,462191,855,00062,251,000266,076,160
3Oct 18, 2024 19:514,4911,114,733,226194,799,00061,193,000264,019,968