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 listJan 19, 2025 00:58Ian MckibbenIan MckibbenScore: 13,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 00:5813,903143,221,027112,008,0002,000,0002,318,336
2Jan 19, 2025 00:5813,909134,236,653113,050,0001,000,0002,441,216
3Jan 19, 2025 00:5813,926138,335,291113,189,0001,001,0002,424,832