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 5, 2026 03:50HattonuriHattonuriScore: 3,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 03:513,937253,531,044179,508,00044,877,000252,006,400
2Jan 5, 2026 03:503,941249,295,448178,698,00045,922,000252,100,608
3Jan 5, 2026 03:503,943252,266,467181,820,00042,957,000251,957,248
4Jan 5, 2026 03:513,943254,354,134183,778,00040,950,000251,994,112
5Jan 5, 2026 03:513,946255,961,795183,943,00040,987,000252,096,512
6Jan 5, 2026 03:503,947249,444,103182,968,00041,992,000252,100,608