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 16, 2026 13:15marko1597marko1597Score: 2,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:362,88732,042,25621,527,0002,154,0002,117,632stderr
2Aug 16, 2026 13:362,89132,126,15420,613,0003,098,0002,117,632stderr
3Aug 16, 2026 13:362,90332,238,85320,724,0003,087,0002,117,632stderr
4Aug 16, 2026 13:362,90432,626,98220,707,0003,111,0002,117,632stderr
5Aug 16, 2026 13:362,94833,736,05721,028,0003,146,0002,117,632stderr
6Aug 16, 2026 13:366,59462,533,71450,964,0003,113,0002,117,632stderr
7Aug 16, 2026 13:366,69663,431,56851,776,0003,135,0002,117,632stderr
8Aug 16, 2026 13:366,71063,476,74751,935,0003,092,0002,117,632stderr
9Aug 16, 2026 13:366,75563,919,82852,222,0003,171,0002,117,632stderr