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 20, 2022 04:26Kenneth MaplesKenneth MaplesError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2022 04:3000000Error: expected "2058173697 ", got "2058173695 "stderr
2Sep 20, 2022 04:26161,4541,384,173,1481,323,924,03602,260,992
3Sep 20, 2022 04:26343,7852,884,450,9892,819,040,27102,260,992
4Sep 20, 2022 04:26479,9854,006,850,6793,935,876,34302,277,376