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 22, 2026 09:07M-RochatM-RochatScore: 4,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:104,683276,418,593208,307,00058,664,000251,682,816
2May 22, 2026 09:104,683278,044,568208,077,00058,899,000251,682,816
3May 22, 2026 09:104,685277,286,425208,115,00058,977,000251,682,816
4May 22, 2026 09:104,700279,416,269208,150,00059,787,000251,682,816
5May 22, 2026 09:104,706277,496,354208,238,00060,034,000251,682,816
6May 22, 2026 09:104,707277,690,652208,089,00060,253,000251,682,816
7May 22, 2026 09:104,710278,020,905208,292,00060,231,000251,682,816
8May 22, 2026 09:104,714278,032,128208,277,00060,421,000251,682,816
9May 22, 2026 09:104,714278,328,604208,290,00060,459,000251,682,816