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 19, 2026 14:06Victor MerckléVictor MerckléScore: 2,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 14:072,85831,731,40622,204,0001,239,0002,117,632stderr
2Aug 19, 2026 14:072,86331,608,17422,229,0001,250,0002,117,632stderr
3Aug 19, 2026 14:072,88931,993,02622,470,0001,224,0002,117,632stderr
4Aug 19, 2026 14:072,91633,540,31022,671,0001,243,0002,117,632stderr
5Aug 19, 2026 14:072,93932,353,26222,865,0001,241,0002,117,632stderr
6Aug 19, 2026 14:072,94232,415,64922,997,0001,130,0002,117,632stderr
7Aug 19, 2026 14:072,95232,469,36222,972,0001,238,0002,117,632stderr
8Aug 19, 2026 14:075,59954,180,57844,891,0001,025,0002,117,632stderr
9Aug 19, 2026 14:075,65454,585,57745,340,0001,023,0002,117,632stderr