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 29, 2026 12:12Victor MerckléVictor MerckléScore: 2,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 12:132,73330,500,93921,333,0001,082,0002,117,632stderr
2Aug 29, 2026 12:132,74830,849,32321,453,0001,085,0002,117,632stderr
3Aug 29, 2026 12:132,75830,864,35121,607,0001,016,0002,117,632stderr
4Aug 29, 2026 12:132,75930,779,04221,462,0001,162,0002,117,632stderr
5Aug 29, 2026 12:132,76230,866,56121,628,0001,026,0002,117,632stderr
6Aug 29, 2026 12:132,76531,010,38921,492,0001,188,0002,117,632stderr
7Aug 29, 2026 12:132,76931,701,44821,699,0001,011,0002,117,632stderr
8Aug 29, 2026 12:135,39152,538,33343,178,0001,036,0002,117,632stderr
9Aug 29, 2026 12:135,42254,818,81243,347,0001,119,0002,117,632stderr