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 13, 2021 17:51Yurkov AlekseyYurkov AlekseyScore: 42,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 17:5136,150358,735,752296,428,03802,293,760
2Jun 13, 2021 17:5139,301382,395,937322,266,69302,297,856
3Jun 13, 2021 17:5140,947395,596,524335,763,72802,293,760
4Jun 13, 2021 17:5141,921418,566,747343,751,80302,293,760
5Jun 13, 2021 17:5142,166403,660,289345,765,28302,174,976
6Jun 13, 2021 17:5143,810423,510,261359,246,02702,293,760
7Jun 13, 2021 17:5144,030420,196,635361,046,68402,293,760
8Jun 13, 2021 17:5146,419439,403,575380,639,51502,174,976
9Jun 13, 2021 17:5147,896458,109,279392,745,78702,301,952