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 09:04Dmitry DolgopolovDmitry DolgopolovScore: 108,532Success
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 09:1387,743778,633,008719,491,04002,211,840
2Jun 12, 2021 09:0496,382845,544,860790,328,65402,203,648
3Jun 12, 2021 09:0498,296872,116,130806,030,19702,199,552
4Jun 12, 2021 09:13101,959886,246,557836,060,37402,207,744
5Jun 12, 2021 09:04108,532952,952,579889,958,99902,207,744
6Jun 12, 2021 09:04108,994959,198,441893,750,26802,203,648
7Jun 12, 2021 09:04112,929985,472,482926,014,81502,207,744
8Jun 12, 2021 09:13112,9311,016,820,962926,032,36302,203,648
9Jun 12, 2021 09:04117,0711,024,798,550959,983,52202,199,552