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 14:54Bohdan StorozhukBohdan StorozhukScore: 6,631Success
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 14:546,521395,120,003311,733,00059,948,000251,899,904
2Jan 8, 2025 14:546,531401,462,950309,405,00062,879,000251,916,288
3Jan 8, 2025 14:546,582407,329,510312,313,00062,861,000251,957,248
4Jan 8, 2025 14:546,611404,783,564315,849,00060,970,000251,895,808
5Jan 8, 2025 14:546,631406,779,520319,965,00057,993,000251,981,824
6Jan 8, 2025 14:546,634407,485,918321,260,00056,869,000251,904,000
7Jan 8, 2025 14:546,642401,508,420304,695,00073,926,000251,899,904
8Jan 8, 2025 14:546,650405,994,682310,056,00069,012,000252,026,880
9Jan 8, 2025 14:546,665409,282,125318,922,00060,985,000251,895,808