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 19, 2026 08:52Victor MerckléVictor MerckléScore: 5,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 08:562,81932,142,18822,101,0001,019,0002,117,632stderr
2Aug 19, 2026 08:562,83231,362,39922,210,0001,019,0002,117,632stderr
3Aug 19, 2026 08:562,83533,576,77322,211,0001,039,0002,117,632stderr
4Aug 19, 2026 08:565,39352,501,88943,175,0001,051,0002,117,632stderr
5Aug 19, 2026 08:565,41552,530,40743,348,0001,055,0002,117,632stderr
6Aug 19, 2026 08:565,45852,915,57143,710,0001,047,0002,117,632stderr
7Aug 19, 2026 08:565,47655,100,95343,761,0001,148,0002,117,632stderr
8Aug 19, 2026 08:565,52353,762,99544,276,0001,016,0002,117,632stderr
9Aug 19, 2026 08:565,59854,854,00244,767,0001,137,0002,117,632stderr