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 19, 2021 13:20alex3dalex3dScore: 85,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 13:2073,372660,969,974601,649,70802,174,976
2Jun 19, 2021 13:2085,869763,520,485704,128,66302,207,744
3Jun 19, 2021 13:2087,452777,460,821717,109,14502,174,976