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 7, 2022 11:18Franek KortaFranek KortaScore: 1,003,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2022 11:16994,2378,217,932,7528,152,739,51002,289,664
2Aug 7, 2022 11:18996,8148,232,717,2468,173,873,83302,293,760
3Aug 7, 2022 11:16999,6438,267,540,7058,197,073,36002,301,952
4Aug 7, 2022 11:181,003,4798,299,283,5798,228,528,83902,293,760
5Aug 7, 2022 11:181,005,0088,320,143,7368,241,064,94902,289,664
6Aug 7, 2022 11:161,009,8388,346,256,6778,280,675,20002,289,664