Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listApr 28, 2026 01:03Charles CabergsCharles CabergsScore: 9,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 01:034,85956,653,01036,858,0002,988,0002,363,392
2Apr 28, 2026 01:034,91357,510,07539,285,0001,007,0002,326,528
3Apr 28, 2026 01:034,91960,224,84835,294,0005,042,0002,363,392
4Apr 28, 2026 01:039,90998,741,89079,248,0002,006,0002,347,008
5Apr 28, 2026 01:039,95196,183,03877,577,0004,029,0002,301,952
6Apr 28, 2026 01:039,98195,642,38075,862,0005,989,0002,379,776
7Apr 28, 2026 01:039,98899,197,85776,909,0004,994,0002,330,624
8Apr 28, 2026 01:039,99595,804,12577,965,0003,998,0002,375,680
9Apr 28, 2026 01:039,995103,295,44078,965,0002,998,0002,400,256