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 18:14Victor MerckléVictor MerckléScore: 2,904Success
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:152,75030,898,41321,537,0001,014,0002,117,632stderr
2Aug 23, 2026 18:152,76231,857,34221,626,0001,028,0002,117,632stderr
3Aug 23, 2026 18:152,77931,151,30721,769,0001,024,0002,117,632stderr
4Aug 23, 2026 18:152,83931,720,19822,096,0001,185,0002,117,632stderr
5Aug 23, 2026 18:152,90440,141,65022,736,0001,080,0002,117,632stderr
6Aug 23, 2026 18:155,38252,556,61243,086,0001,048,0002,117,632stderr
7Aug 23, 2026 18:155,42952,844,67443,390,0001,131,0002,117,632stderr
8Aug 23, 2026 18:155,45053,082,85543,557,0001,137,0002,117,632stderr
9Aug 23, 2026 18:155,73661,395,24845,948,0001,093,0002,117,632stderr