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 18, 2026 04:12M-RochatM-RochatScore: 4,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 04:144,798282,977,536252,805,00020,720,000249,901,056
2May 18, 2026 04:144,798283,635,178252,883,00020,634,000249,896,960
3May 18, 2026 04:144,799282,914,069252,899,00020,662,000249,872,384
4May 18, 2026 04:144,800283,257,734252,898,00020,735,000249,892,864
5May 18, 2026 04:144,801283,531,001252,944,00020,743,000249,856,000
6May 18, 2026 04:144,801282,816,911252,914,00020,772,000249,896,960
7May 18, 2026 04:144,805285,119,374252,909,00021,014,000249,905,152
8May 18, 2026 04:144,806284,946,952252,943,00021,050,000249,909,248
9May 18, 2026 04:144,806284,174,160252,944,00021,026,000249,880,576