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 listJun 21, 2021 15:42Dmitry DolgopolovDmitry DolgopolovScore: 28,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2021 15:4328,649304,476,734234,921,75902,191,360
2Jun 21, 2021 15:4328,734294,974,739235,619,83702,195,456
3Jun 21, 2021 15:4228,807290,952,293236,214,85902,199,552
4Jun 21, 2021 15:4328,910302,969,208237,058,30602,195,456
5Jun 21, 2021 15:4228,936291,463,448237,278,02702,199,552
6Jun 21, 2021 15:4229,002296,024,937237,818,17502,195,456