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:10Victor MerckléVictor MerckléScore: 5,450Success
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:112,77731,027,95021,760,0001,016,0002,117,632stderr
2Aug 23, 2026 15:112,78631,094,25521,772,0001,078,0002,117,632stderr
3Aug 23, 2026 15:112,79431,957,86921,896,0001,021,0002,117,632stderr
4Aug 23, 2026 15:115,43853,614,11243,462,0001,135,0002,117,632stderr
5Aug 23, 2026 15:115,45053,743,03543,508,0001,183,0002,117,632stderr
6Aug 23, 2026 15:115,46653,804,08143,814,0001,015,0002,117,632stderr
7Aug 23, 2026 15:115,56862,929,56244,424,0001,238,0002,117,632stderr
8Aug 23, 2026 15:115,57453,969,07644,684,0001,029,0002,117,632stderr
9Aug 23, 2026 15:115,58854,132,33744,789,0001,037,0002,117,632stderr