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 18:18Victor MerckléVictor MerckléScore: 2,775Success
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 18:202,73230,748,92421,315,0001,092,0002,117,632stderr
2Aug 23, 2026 18:202,76231,015,92021,628,0001,024,0002,117,632stderr
3Aug 23, 2026 18:202,76331,114,60121,649,0001,011,0002,117,632stderr
4Aug 23, 2026 18:202,76330,982,34321,642,0001,016,0002,117,632stderr
5Aug 23, 2026 18:202,77531,121,25321,729,0001,033,0002,117,632stderr
6Aug 23, 2026 18:202,77531,146,20721,578,0001,185,0002,117,632stderr
7Aug 23, 2026 18:205,35952,309,58042,896,0001,055,0002,117,632stderr
8Aug 23, 2026 18:205,39152,556,93043,097,0001,113,0002,117,632stderr
9Aug 23, 2026 18:205,42552,830,28643,361,0001,131,0002,117,632stderr