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 listAug 29, 2026 13:52Victor MerckléVictor MerckléScore: 5,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:552,74330,940,93721,408,0001,087,0002,117,632stderr
2Aug 29, 2026 13:552,74430,944,22521,419,0001,082,0002,117,632stderr
3Aug 29, 2026 13:552,77031,092,83021,683,0001,034,0002,117,632stderr
4Aug 29, 2026 13:552,77131,073,18621,705,0001,022,0002,117,632stderr
5Aug 29, 2026 13:555,40452,458,99143,183,0001,132,0002,117,632stderr
6Aug 29, 2026 13:555,42252,774,10243,427,0001,040,0002,117,632stderr
7Aug 29, 2026 13:555,43453,533,21243,433,0001,132,0002,117,632stderr
8Aug 29, 2026 13:555,44052,979,62843,530,0001,080,0002,117,632stderr
9Aug 29, 2026 13:555,78155,764,71246,388,0001,017,0002,117,632stderr