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:59Victor MerckléVictor MerckléScore: 2,894Success
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 18:002,82931,557,85322,006,0001,198,0002,117,632stderr
2Aug 23, 2026 18:002,85931,792,10822,427,0001,023,0002,117,632stderr
3Aug 23, 2026 18:002,86231,768,94322,450,0001,025,0002,117,632stderr
4Aug 23, 2026 18:002,87932,610,41222,559,0001,053,0002,117,632stderr
5Aug 23, 2026 18:002,89432,770,62822,459,0001,278,0002,117,632stderr
6Aug 23, 2026 18:005,44452,979,24343,619,0001,029,0002,117,632stderr
7Aug 23, 2026 18:005,51953,575,00244,238,0001,018,0002,117,632stderr
8Aug 23, 2026 18:0014,376126,852,910116,877,0001,007,0002,117,632stderr
9Aug 23, 2026 18:0014,376126,293,027116,877,0001,008,0002,117,632stderr