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 09:19HattonuriHattonuriScore: 3,975Success
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 09:193,959248,366,533180,940,00044,737,000254,189,568
2Jan 5, 2026 09:183,962257,171,144180,882,00044,970,000253,956,096
3Jan 5, 2026 09:183,964246,609,980182,155,00043,796,000253,939,712
4Jan 5, 2026 09:193,975250,381,587182,673,00043,921,000254,087,168
5Jan 5, 2026 09:193,978253,570,272182,786,00043,948,000254,091,264
6Jan 5, 2026 09:183,988254,834,168180,229,00047,059,000254,099,456