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 12:44Andrey TsvetkovAndrey TsvetkovScore: 111,904Success
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 12:4487,553774,223,898717,930,72102,273,280
2Jun 20, 2021 12:44108,434945,233,819889,160,59102,207,744
3Jun 20, 2021 12:44111,059981,087,195910,685,98702,203,648
4Jun 20, 2021 12:44111,904976,520,851917,613,07602,199,552
5Jun 20, 2021 12:44112,399983,791,354921,672,04402,207,744
6Jun 20, 2021 12:44125,3681,086,425,4441,028,019,57302,199,552