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 31, 2024 02:19Joad NacerJoad NacerScore: 3,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2024 02:193,903244,909,993196,519,00025,936,000250,298,368
2Dec 31, 2024 02:193,917248,163,694196,230,00027,031,000250,028,032
3Dec 31, 2024 02:193,922244,402,182197,616,00025,949,000250,298,368