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 17, 2026 02:59M-RochatM-RochatScore: 5,761Success
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 03:025,753339,558,358269,255,00058,700,000251,682,816
2May 17, 2026 03:025,758339,986,654269,259,00059,000,000251,682,816
3May 17, 2026 03:025,760337,699,702269,329,00059,021,000251,682,816
4May 17, 2026 03:025,761337,445,658269,277,00059,148,000251,682,816
5May 17, 2026 03:025,761338,506,986269,344,00059,046,000251,682,816
6May 17, 2026 03:025,772339,921,621269,401,00059,641,000251,682,816
7May 17, 2026 03:025,775338,166,922269,243,00059,954,000251,682,816
8May 17, 2026 03:025,778338,303,900269,418,00059,977,000251,682,816
9May 17, 2026 03:025,783341,588,494269,494,00060,180,000251,682,816