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 11, 2021 20:11Yuriy LyfenkoYuriy LyfenkoScore: 130,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 20:1485,443758,335,931700,632,12702,297,856
2Jun 11, 2021 20:14104,283919,167,944855,123,74402,310,144
3Jun 11, 2021 20:11115,5361,007,408,430947,394,03902,310,144
4Jun 11, 2021 20:11130,9261,132,810,9261,073,590,70602,310,144
5Jun 11, 2021 20:14133,3891,155,286,1181,093,788,30802,248,704
6Jun 11, 2021 20:11136,8341,174,102,7211,122,034,74002,297,856