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:19Yuriy LyfenkoYuriy LyfenkoScore: 122,905Success
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:20105,511931,586,270865,192,43302,301,952
2Jun 11, 2021 20:20116,5221,019,340,121955,479,83502,297,856
3Jun 11, 2021 20:19122,8931,073,332,1791,007,722,30802,297,856
4Jun 11, 2021 20:20122,9051,076,800,0341,007,821,77702,301,952
5Jun 11, 2021 20:19130,2031,138,456,9571,067,666,73902,310,144
6Jun 11, 2021 20:19135,4711,175,484,8141,110,864,48602,297,856