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 12, 2022 21:03Egor SergeevEgor SergeevScore: 58,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2022 21:0058,147534,517,220476,801,51602,301,952
2Aug 12, 2022 21:0058,166539,869,708476,963,07502,289,664
3Aug 12, 2022 21:0358,531547,804,646479,953,92002,297,856
4Aug 12, 2022 21:0358,576535,687,154480,326,30502,289,664
5Aug 12, 2022 21:0058,772546,518,586481,927,66402,297,856
6Aug 12, 2022 21:0358,822547,530,491482,341,33302,293,760