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 listAug 30, 2026 16:13Tomislav TunkovicTomislav TunkovicScore: 1,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 16:211,36586,116,07756,839,00020,984,000249,880,576
2Aug 30, 2026 16:211,36686,323,35857,089,00020,823,000249,876,480
3Aug 30, 2026 16:211,36686,177,45356,854,00021,047,000249,888,768
4Aug 30, 2026 16:211,36786,165,61756,833,00021,094,000249,921,536
5Aug 30, 2026 16:211,36786,305,50257,137,00020,833,000249,880,576
6Aug 30, 2026 16:211,36886,374,14356,796,00021,220,000249,876,480
7Aug 30, 2026 16:211,37786,710,94257,815,00020,722,000249,860,096
8Aug 30, 2026 16:211,39098,968,83356,787,00022,481,000249,868,288
9Aug 30, 2026 16:211,39788,075,17258,853,00020,778,000249,872,384