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 11, 2026 22:42Alexander FrolovAlexander FrolovScore: 5,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 22:425,021312,600,890264,169,00022,014,000250,265,600
2Jan 11, 2026 22:425,021311,834,658263,261,00022,935,000250,249,216
3Jan 11, 2026 22:425,026315,431,695262,549,00023,958,000250,245,120