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 listOct 12, 2022 01:42Kenneth MaplesKenneth MaplesScore: 52,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2022 01:4237,863368,562,780310,478,81702,203,648
2Oct 12, 2022 01:4252,258491,691,618428,514,76502,260,992
3Oct 12, 2022 01:4255,187511,354,086452,537,24202,293,760