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 14, 2026 18:33marko1597marko1597Score: 3,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:393,70138,748,87529,309,0001,043,0002,121,728stderr
2Aug 14, 2026 18:393,71338,899,60129,399,0001,051,0002,121,728stderr
3Aug 14, 2026 18:393,74239,065,01729,634,0001,054,0002,121,728stderr
4Aug 14, 2026 18:393,75039,160,27829,701,0001,049,0002,121,728stderr
5Aug 14, 2026 18:393,75839,190,20429,775,0001,041,0002,121,728stderr
6Aug 14, 2026 18:393,78139,280,85629,972,0001,037,0002,121,728stderr
7Aug 14, 2026 18:393,78839,376,59330,047,0001,019,0002,121,728stderr
8Aug 14, 2026 18:393,82339,599,14330,331,0001,025,0002,121,728stderr
9Aug 14, 2026 18:393,83339,888,36630,400,0001,037,0002,121,728stderr