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 29, 2024 15:34Drew GarciaDrew GarciaScore: 79,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2024 15:3459,309546,409,768486,330,82102,277,376
2Mar 29, 2024 15:4059,993557,011,456491,941,04702,277,376
3Mar 29, 2024 15:4066,431607,612,731544,732,10302,265,088
4Mar 29, 2024 15:3479,897724,392,153655,154,05302,265,088
5Mar 29, 2024 15:4082,797740,162,702678,931,79902,277,376
6Mar 29, 2024 15:34127,8441,110,801,2931,048,317,86002,281,472