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 listNov 1, 2021 01:27Jules MinierJules MinierScore: 120,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 01:27119,3791,056,005,481978,906,79602,269,184
2Nov 1, 2021 01:27120,1741,046,034,993985,424,17902,252,800
3Nov 1, 2021 01:27120,8321,063,516,554990,819,12402,256,896