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 listJun 9, 2024 18:32Mikhail ShirokovMikhail ShirokovScore: 21,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2024 18:3221,287245,102,564174,552,07302,277,376
2Jun 9, 2024 18:3221,940236,736,127179,908,50702,273,280
3Jun 9, 2024 18:3222,181244,693,749181,884,63302,260,992