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 listJan 8, 2025 09:42Bohdan StorozhukBohdan StorozhukScore: 6,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2025 09:426,700410,297,758324,932,00056,988,000251,953,152
2Jan 8, 2025 09:426,703409,684,747320,230,00061,851,000251,895,808
3Jan 8, 2025 09:426,709407,225,964324,522,00057,914,000251,904,000
4Jan 8, 2025 09:426,712400,735,372325,628,00056,935,000251,899,904
5Jan 8, 2025 09:426,716405,174,881323,824,00058,967,000251,899,904
6Jan 8, 2025 09:426,716410,831,627323,837,00058,970,000251,944,960
7Jan 8, 2025 09:426,731412,678,194321,742,00061,950,000252,063,744
8Jan 8, 2025 09:426,749411,700,459324,752,00059,954,000251,940,864
9Jan 8, 2025 09:426,763408,272,373325,570,00059,921,000251,899,904