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 listMar 18, 2026 04:41limanjun99limanjun99Score: 109,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:4199,145849,693,992679,159,000133,834,0002,281,472
2Mar 18, 2026 04:41109,750925,771,750778,092,000121,857,0002,318,336
3Mar 18, 2026 04:41117,889996,924,893838,862,000127,826,0002,318,336