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 29, 2026 12:08Victor MerckléVictor MerckléScore: 2,751Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 12:102,72330,662,14221,245,0001,090,0002,117,632stderr
2Aug 29, 2026 12:102,74130,835,56421,341,0001,141,0002,117,632stderr
3Aug 29, 2026 12:102,74831,543,09521,518,0001,021,0002,117,632stderr
4Aug 29, 2026 12:102,75130,867,11621,527,0001,033,0002,117,632stderr
5Aug 29, 2026 12:102,75131,581,04421,539,0001,023,0002,117,632stderr
6Aug 29, 2026 12:102,75330,766,47121,539,0001,040,0002,117,632stderr
7Aug 29, 2026 12:102,76230,778,24921,626,0001,025,0002,117,632stderr
8Aug 29, 2026 12:105,40552,738,17943,153,0001,172,0002,117,632stderr
9Aug 29, 2026 12:105,55453,892,58544,527,0001,018,0002,117,632stderr