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 listMay 16, 2026 23:59M-RochatM-RochatScore: 6,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:036,497379,198,244310,877,00059,486,000251,682,816
2May 17, 2026 00:036,497379,298,310311,010,00059,367,000251,682,816
3May 17, 2026 00:036,500379,359,159311,050,00059,483,000251,682,816
4May 17, 2026 00:036,500380,975,761310,891,00059,643,000251,682,816
5May 17, 2026 00:036,501380,212,673311,079,00059,511,000251,682,816
6May 17, 2026 00:036,502380,246,100310,725,00059,916,000251,682,816
7May 17, 2026 00:036,506380,368,547310,929,00059,944,000251,682,816
8May 17, 2026 00:036,509382,227,336311,092,00059,961,000251,682,816
9May 17, 2026 00:036,519380,397,420311,606,00059,992,000251,682,816