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 19, 2025 10:09Alexander FrolovAlexander FrolovScore: 4,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 10:094,019258,532,652207,088,00022,009,000250,314,752
2Jan 19, 2025 10:094,020255,574,530208,117,00021,011,000250,322,944
3Jan 19, 2025 10:094,026259,416,398210,518,00018,956,000250,019,840