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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:082,72830,675,36521,333,0001,040,0002,117,632stderr
2Aug 31, 2026 12:082,74130,837,08021,438,0001,043,0002,117,632stderr
3Aug 31, 2026 12:082,74230,962,92721,470,0001,016,0002,117,632stderr
4Aug 31, 2026 12:082,75131,595,60821,535,0001,031,0002,117,632stderr
5Aug 31, 2026 12:082,75731,648,15421,590,0001,023,0002,117,632stderr
6Aug 31, 2026 12:082,80831,376,70121,856,0001,176,0002,117,632stderr
7Aug 31, 2026 12:085,40152,607,49043,159,0001,130,0002,117,632stderr
8Aug 31, 2026 12:085,41252,542,81443,232,0001,149,0002,117,632stderr
9Aug 31, 2026 12:085,60054,085,90344,904,0001,020,0002,117,632stderr