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 listNov 25, 2024 00:14Joad NacerJoad NacerScore: 5,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2024 00:145,898636,635,246259,214,00076,971,000266,498,048
2Nov 25, 2024 00:145,937653,096,018256,891,00081,503,000266,469,376
3Nov 25, 2024 00:145,968671,881,807256,744,00083,414,000266,420,224