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:52limanjun99limanjun99Score: 42,475Success
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:5241,948367,935,331340,975,0002,999,0002,498,560
2Mar 18, 2026 04:5242,475376,717,647346,291,0002,001,0002,371,584
3Mar 18, 2026 04:5243,183381,307,586352,098,0002,000,0002,449,408