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 3, 2022 12:55Robert BurkeRobert BurkeScore: 4,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 12:564,59292,848,92037,656,81702,293,760
2Aug 3, 2022 12:564,648101,045,12838,114,22102,195,456
3Aug 3, 2022 12:564,702106,576,45538,555,43602,207,744
4Aug 3, 2022 12:554,776108,330,24539,159,67702,228,224
5Aug 3, 2022 12:554,83796,136,36839,663,66102,252,800
6Aug 3, 2022 12:554,896104,629,94040,147,83202,240,512