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 9, 2026 02:10Taylor DettlingTaylor DettlingScore: 3,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 02:002,983193,987,549146,049,00024,008,000250,052,608
2Apr 9, 2026 02:002,988201,147,867145,435,00024,903,000250,138,624
3Apr 9, 2026 02:002,991197,005,865144,544,00025,918,000250,052,608
4Apr 9, 2026 02:103,047207,441,372153,855,00019,852,000250,056,704
5Apr 9, 2026 02:103,053205,693,885149,032,00025,005,000250,085,376
6Apr 9, 2026 02:103,055203,214,307149,390,00024,733,000250,081,280