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 listMar 17, 2026 14:01limanjun99limanjun99Score: 103,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:0193,220786,196,148625,513,000138,892,0002,293,760
2Mar 17, 2026 14:01103,357878,060,437718,601,000128,928,0002,301,952
3Mar 17, 2026 14:01113,147954,705,126797,834,000129,973,0002,293,760