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 20, 2021 13:27Andrey TsvetkovAndrey TsvetkovScore: 173,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 13:26113,784993,800,151933,027,28702,236,416
2Jun 20, 2021 13:26120,4681,047,663,043987,839,96602,297,856
3Jun 20, 2021 13:27125,5051,101,314,8271,029,144,60802,256,896
4Jun 20, 2021 13:25134,2081,167,040,1661,100,504,55102,240,512
5Jun 20, 2021 13:26173,2803,848,363,7191,420,893,26802,277,376
6Jun 20, 2021 13:25282,78412,826,736,6202,318,825,02702,293,760
7Jun 20, 2021 13:25318,33315,894,446,2612,610,334,68802,293,760
8Jun 20, 2021 13:27361,40518,208,272,6412,963,521,82902,297,856
9Jun 20, 2021 13:27366,40416,046,326,8523,004,511,73806,029,312