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 17:49Victor MerckléVictor MerckléScore: 2,956Success
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 17:502,82731,635,56322,086,0001,101,0002,117,632stderr
2Aug 23, 2026 17:502,83531,684,49722,021,0001,233,0002,117,632stderr
3Aug 23, 2026 17:502,84731,697,61622,256,0001,092,0002,117,632stderr
4Aug 23, 2026 17:502,85931,755,20922,424,0001,026,0002,117,632stderr
5Aug 23, 2026 17:502,95638,586,96823,043,0001,200,0002,117,632stderr
6Aug 23, 2026 17:505,51453,569,17944,197,0001,022,0002,117,632stderr
7Aug 23, 2026 17:505,53954,434,50344,405,0001,020,0002,117,632stderr
8Aug 23, 2026 17:505,56453,978,84144,606,0001,025,0002,117,632stderr
9Aug 23, 2026 17:505,57554,740,21644,694,0001,024,0002,117,632stderr