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 listAug 2, 2022 22:55Robert BurkeRobert BurkeScore: 4,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 22:564,946101,749,31340,554,77102,207,744
2Aug 2, 2022 22:564,96298,938,45940,691,34002,220,032
3Aug 2, 2022 22:564,96295,479,97640,688,48602,199,552
4Aug 2, 2022 22:554,97991,473,90540,829,93102,174,976
5Aug 2, 2022 22:554,98396,099,89340,857,17002,220,032
6Aug 2, 2022 22:565,021101,425,40841,169,71002,260,992
7Aug 2, 2022 22:555,026103,070,92241,217,15902,293,760
8Aug 2, 2022 22:565,067106,873,12641,547,93802,269,184
9Aug 2, 2022 22:565,08596,779,03841,692,96902,277,376