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 listMay 16, 2023 16:24Martin StensgårdMartin StensgårdScore: 27,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2023 16:2426,638295,620,900218,431,53602,289,664
2May 16, 2023 16:2427,029280,674,070221,636,97302,244,608
3May 16, 2023 16:2427,172289,187,834222,814,03102,179,072