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 23, 2026 17:05Victor MerckléVictor MerckléScore: 2,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:062,78031,814,20821,786,0001,016,0002,117,632stderr
2Aug 23, 2026 17:062,78231,249,89321,799,0001,019,0002,117,632stderr
3Aug 23, 2026 17:062,78431,172,76121,753,0001,081,0002,117,632stderr
4Aug 23, 2026 17:062,78931,241,04721,855,0001,017,0002,117,632stderr
5Aug 23, 2026 17:062,80331,359,58021,976,0001,015,0002,117,632stderr
6Aug 23, 2026 17:062,90632,238,57122,560,0001,274,0002,117,632stderr
7Aug 23, 2026 17:065,43952,952,28843,477,0001,127,0002,117,632stderr
8Aug 23, 2026 17:065,46053,150,45643,654,0001,121,0002,117,632stderr
9Aug 23, 2026 17:065,58854,182,31444,808,0001,019,0002,117,632stderr