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 12, 2021 08:53Dmitry DolgopolovDmitry DolgopolovScore: 106,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 08:5093,520830,988,398766,861,49802,281,472
2Jun 12, 2021 08:5093,570831,441,596767,275,29902,285,568
3Jun 12, 2021 08:5399,583876,012,703816,582,68102,277,376
4Jun 12, 2021 08:56104,765930,319,937859,070,09702,293,760
5Jun 12, 2021 08:56106,659942,478,858874,604,32002,269,184
6Jun 12, 2021 08:53106,931941,155,343876,831,97302,273,280
7Jun 12, 2021 08:56110,811966,771,504908,653,11602,285,568
8Jun 12, 2021 08:50113,941991,608,277934,316,60402,293,760
9Jun 12, 2021 08:53114,4101,017,607,202938,161,69402,285,568