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 15, 2023 13:35Martin StensgårdMartin StensgårdScore: 51,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2023 13:3551,473472,669,661422,078,77102,215,936
2May 15, 2023 13:3551,732488,487,008424,201,83202,215,936
3May 15, 2023 13:3552,995497,361,473434,558,71402,318,336