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 12, 2025 15:53Alexander FrolovAlexander FrolovScore: 3,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2025 15:533,503221,657,180174,717,00024,959,000250,257,408
2Jan 12, 2025 15:533,509234,312,768181,996,00017,999,000250,269,696
3Jan 12, 2025 15:533,510228,056,783177,049,00023,006,000250,126,336
4Jan 12, 2025 15:533,510228,691,284180,060,00020,006,000250,105,856
5Jan 12, 2025 15:533,511226,797,658177,118,00023,015,000250,105,856
6Jan 12, 2025 15:533,512232,357,933178,171,00022,021,000250,134,528
7Jan 12, 2025 15:533,515231,962,217184,402,00015,948,000250,093,568
8Jan 12, 2025 15:533,515232,775,047175,435,00024,919,000250,294,272
9Jan 12, 2025 15:533,516227,230,462181,484,00018,946,000250,105,856