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 listMar 27, 2024 20:36emily graceemily graceScore: 134,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 20:42110,984971,864,602910,068,51902,260,992
2Mar 27, 2024 20:42118,4811,041,691,325971,543,02502,306,048
3Mar 27, 2024 20:42129,9501,119,692,3301,065,588,43402,306,048
4Mar 27, 2024 20:36134,6381,166,153,5021,104,028,82702,297,856
5Mar 27, 2024 20:36145,4471,265,334,7941,192,669,10702,293,760
6Mar 27, 2024 20:36177,1931,519,405,0971,452,984,61902,301,952