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 listSep 1, 2026 06:04Victor MerckléVictor MerckléScore: 5,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:062,85631,791,03022,267,0001,153,0002,117,632stderr
2Sep 1, 2026 06:062,86731,890,12022,374,0001,143,0002,117,632stderr
3Sep 1, 2026 06:062,91332,276,29122,756,0001,131,0002,117,632stderr
4Sep 1, 2026 06:065,47253,089,93443,697,0001,179,0002,117,632stderr
5Sep 1, 2026 06:065,49853,425,22944,044,0001,040,0002,117,632stderr
6Sep 1, 2026 06:065,53853,598,30444,398,0001,021,0002,117,632stderr
7Sep 1, 2026 06:065,59554,183,11744,867,0001,016,0002,117,632stderr
8Sep 1, 2026 06:065,66154,818,36545,403,0001,021,0002,117,632stderr
9Sep 1, 2026 06:0614,768129,461,120120,092,0001,008,0002,117,632stderr