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 6, 2024 20:50Alexander FrolovAlexander FrolovScore: 4,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2024 20:504,780555,031,062272,462,3420265,555,968
2Jan 6, 2024 20:504,859577,880,312276,948,8130264,044,544
3Jan 6, 2024 20:504,886526,818,702206,102,00072,387,000267,743,232
4Jan 6, 2024 20:504,897510,773,650215,354,00063,769,000267,816,960
5Jan 6, 2024 20:504,900522,192,764216,882,00062,404,000267,833,344
6Jan 6, 2024 20:504,903602,593,714279,467,9390266,473,472
7Jan 6, 2024 20:504,904520,517,798203,832,00075,680,000267,898,880
8Jan 6, 2024 20:504,908516,089,845212,818,00066,943,000267,845,632
9Jan 6, 2024 20:504,965530,227,819209,987,00072,995,000267,808,768
10Jan 6, 2024 20:504,970530,320,738220,785,00062,486,000267,841,536
11Jan 6, 2024 20:504,970536,699,372205,319,00077,982,000267,808,768
12Jan 6, 2024 20:504,973545,484,788208,862,00074,593,000267,833,344