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 listApr 3, 2026 05:52Taylor DettlingTaylor DettlingScore: 3,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 18:433,524231,362,403175,995,00024,858,000250,310,656
2Apr 3, 2026 05:523,530228,856,843179,283,00021,912,000250,281,984
3Apr 3, 2026 18:433,533229,180,429182,440,00018,941,000250,155,008
4Apr 3, 2026 05:523,535228,680,439181,564,00019,952,000250,052,608
5Apr 3, 2026 18:433,537233,172,216179,677,00021,960,000250,310,656
6Apr 3, 2026 05:523,539230,623,712181,763,00019,973,000250,290,176