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 16:21Alexander FrolovAlexander FrolovScore: 4,028Success
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 16:214,024257,132,212209,413,00019,944,000250,044,416
2Jan 19, 2025 16:214,028253,266,173205,634,00023,957,000250,224,640
3Jan 19, 2025 16:214,032256,281,746207,847,00021,983,000250,208,256