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:52Victor MerckléVictor MerckléScore: 2,893Success
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:542,86031,778,29822,239,0001,213,0002,117,632stderr
2Aug 23, 2026 17:542,86231,835,39022,299,0001,171,0002,117,632stderr
3Aug 23, 2026 17:542,86731,921,56222,488,0001,023,0002,117,632stderr
4Aug 23, 2026 17:542,87732,168,35922,567,0001,029,0002,117,632stderr
5Aug 23, 2026 17:542,89333,448,76922,697,0001,027,0002,117,632stderr
6Aug 23, 2026 17:542,89332,729,48822,702,0001,027,0002,117,632stderr
7Aug 23, 2026 17:542,89632,697,37622,451,0001,300,0002,117,632stderr
8Aug 23, 2026 17:542,89732,005,41022,467,0001,295,0002,117,632stderr
9Aug 23, 2026 17:545,55753,958,27744,551,0001,020,0002,117,632stderr