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:32HattonuriHattonuriScore: 3,983Success
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:303,975250,090,787183,638,00042,915,000251,834,368
2Jan 5, 2026 03:313,976249,599,310184,693,00041,930,000252,096,512
3Jan 5, 2026 03:313,981258,590,275182,133,00044,787,000252,096,512
4Jan 5, 2026 03:303,982254,100,065183,188,00043,805,000252,096,512
5Jan 5, 2026 03:323,983257,488,607184,042,00043,009,000251,949,056
6Jan 5, 2026 03:323,986251,585,844183,367,00043,848,000251,990,016
7Jan 5, 2026 03:303,988249,429,750179,453,00047,854,000252,100,608
8Jan 5, 2026 03:323,988264,551,982180,444,00046,855,000252,002,304
9Jan 5, 2026 03:314,042251,238,764181,518,00048,870,000251,842,560