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 19, 2021 10:00Dmitry DolgopolovDmitry DolgopolovScore: 519,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 10:01160,8571,380,038,7281,319,030,64002,277,376
2Jun 19, 2021 10:01189,2071,609,806,9141,551,493,66702,289,664
3Jun 19, 2021 10:00282,5182,387,868,3462,316,650,74802,285,568
4Jun 19, 2021 10:01519,7524,321,584,0384,261,963,63302,285,568
5Jun 19, 2021 10:00611,1755,081,385,5125,011,638,98702,211,840
6Jun 19, 2021 10:00970,6768,039,546,1497,959,540,94302,289,664