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 13, 2021 19:54Sergey StreminSergey StreminScore: 17,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2021 19:5417,307200,670,223141,920,33502,301,952
2Oct 13, 2021 19:5417,709216,485,387145,210,09102,195,456
3Oct 13, 2021 19:5417,768223,336,772145,695,79902,318,336