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 13:00M-RochatM-RochatScore: 7,807Success
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 13:027,782452,379,734385,209,00058,392,000251,682,816
2May 17, 2026 13:027,784453,543,120385,137,00058,556,000251,682,816
3May 17, 2026 13:027,786452,720,210385,169,00058,636,000251,682,816
4May 17, 2026 13:027,807453,975,739385,308,00059,743,000251,682,816
5May 17, 2026 13:027,807456,166,410385,190,00059,848,000251,682,816
6May 17, 2026 13:027,808454,001,282385,331,00059,725,000251,682,816
7May 17, 2026 13:027,810457,043,925385,276,00059,950,000251,682,816
8May 17, 2026 13:027,813456,680,833385,454,00059,898,000251,682,816
9May 17, 2026 13:027,816455,974,968385,318,00060,224,000251,682,816