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 listSep 30, 2023 18:33apuxbtapuxbtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2023 18:3100000Error: Exit with code 255: clt = 50297372 cgt = 45327072stderr
2Sep 30, 2023 18:3200000Error: Exit with code 255: clt = 50739218 cgt = 44723471stderr
3Sep 30, 2023 18:3300000Error: Exit with code 255: clt = 50519170 cgt = 45139795stderr
4Sep 30, 2023 18:3382,592728,231,879677,256,89302,240,512
5Sep 30, 2023 18:3383,870748,128,503687,730,82002,236,416
6Sep 30, 2023 18:3386,208794,803,000706,907,00902,240,512