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 26, 2024 23:19Joad NacerJoad NacerScore: 5,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 23:195,879593,670,560243,983,00091,113,000267,702,272
2Dec 2, 2024 22:015,898591,505,206239,378,00096,792,000267,612,160
3Dec 2, 2024 22:015,909586,924,756251,051,00085,750,000267,751,424
4Dec 2, 2024 22:015,912570,283,169245,808,00091,186,000267,771,904
5Nov 26, 2024 23:195,989606,814,902237,238,000104,153,000267,534,336
6Nov 26, 2024 23:196,002620,025,174244,950,00097,170,000267,517,952