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 15:42Victor MerckléVictor MerckléScore: 5,427Success
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 15:432,76030,757,56821,487,0001,151,0002,138,112stderr
2Aug 23, 2026 15:435,40952,494,11243,223,0001,131,0002,138,112stderr
3Aug 23, 2026 15:435,41652,648,34743,350,0001,068,0002,129,920stderr
4Aug 23, 2026 15:435,42752,696,28343,431,0001,077,0002,138,112stderr
5Aug 23, 2026 15:435,42752,743,51543,412,0001,096,0002,129,920stderr
6Aug 23, 2026 15:435,44252,866,44443,456,0001,170,0002,129,920stderr
7Aug 23, 2026 15:435,54063,951,08644,244,0001,189,0002,129,920stderr
8Aug 23, 2026 15:435,65163,735,29645,160,0001,181,0002,129,920stderr
9Aug 23, 2026 15:4315,293133,683,413124,397,0001,008,0002,129,920stderr