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 listAug 3, 2021 14:44Mikhail ShirokovMikhail ShirokovScore: 139,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2021 14:44134,0441,177,324,5501,099,163,60402,306,048
2Aug 3, 2021 14:44139,2681,201,630,6771,142,001,14402,297,856
3Aug 3, 2021 14:44146,1331,269,278,8931,198,287,59202,306,048