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 10:00Victor MerckléVictor MerckléScore: 2,891Success
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 10:012,85031,677,82222,325,0001,051,0002,117,632stderr
2Aug 19, 2026 10:012,85132,330,66222,320,0001,065,0002,117,632stderr
3Aug 19, 2026 10:012,86031,817,74222,405,0001,051,0002,117,632stderr
4Aug 19, 2026 10:012,88931,978,13622,650,0001,046,0002,117,632stderr
5Aug 19, 2026 10:012,89132,704,96322,647,0001,064,0002,117,632stderr
6Aug 19, 2026 10:012,94433,079,11023,075,0001,069,0002,117,632stderr
7Aug 19, 2026 10:015,42152,734,88443,278,0001,179,0002,117,632stderr
8Aug 19, 2026 10:015,49255,422,25343,936,0001,104,0002,117,632stderr
9Aug 19, 2026 10:015,49353,222,02244,030,0001,019,0002,117,632stderr