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 14:14Victor MerckléVictor MerckléScore: 3,292Success
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 14:153,24634,750,55425,544,0001,079,0002,117,632stderr
2Aug 23, 2026 14:153,25834,879,98825,696,0001,025,0002,117,632stderr
3Aug 23, 2026 14:153,26234,875,36525,745,0001,011,0002,117,632stderr
4Aug 23, 2026 14:153,26435,080,07725,679,0001,090,0002,117,632stderr
5Aug 23, 2026 14:153,29235,944,80025,982,0001,019,0002,117,632stderr
6Aug 23, 2026 14:153,46637,420,84727,213,0001,213,0002,117,632stderr
7Aug 23, 2026 14:156,32860,013,06050,872,0001,025,0002,117,632stderr
8Aug 23, 2026 14:156,35560,320,27051,089,0001,027,0002,117,632stderr
9Aug 23, 2026 14:156,48661,528,16452,071,0001,119,0002,117,632stderr