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:24apuxbtapuxbtError
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:2400000Error: Exit with code 255: clt = 50251822 cgt = 45384422stderr
2Sep 30, 2023 18:2459,624548,404,822488,913,63502,269,184
3Sep 30, 2023 18:2462,930580,753,786516,028,68302,195,456
4Sep 30, 2023 18:2463,686587,855,277522,229,12802,306,048