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 19:20Victor MerckléVictor MerckléScore: 5,419Success
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 19:212,73330,743,64421,313,0001,100,0002,121,728stderr
2Aug 23, 2026 19:212,75830,990,50421,576,0001,044,0002,121,728stderr
3Aug 23, 2026 19:212,76131,616,46721,627,0001,020,0002,121,728stderr
4Aug 23, 2026 19:215,37552,354,16143,023,0001,058,0002,121,728stderr
5Aug 23, 2026 19:215,41952,793,10143,295,0001,147,0002,121,728stderr
6Aug 23, 2026 19:215,42752,791,14943,453,0001,054,0002,121,728stderr
7Aug 23, 2026 19:215,42852,916,41443,319,0001,191,0002,121,728stderr
8Aug 23, 2026 19:215,43252,825,54543,404,0001,141,0002,121,728stderr
9Aug 23, 2026 19:215,45153,242,61243,544,0001,156,0002,121,728stderr