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 14, 2026 22:36Tomislav TunkovicTomislav TunkovicScore: 2,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 22:372,78331,239,86121,807,0001,019,0002,117,632stderr
2Aug 14, 2026 22:372,78431,254,05821,814,0001,018,0002,117,632stderr
3Aug 14, 2026 22:372,78731,260,05521,841,0001,014,0002,117,632stderr
4Aug 14, 2026 22:372,79531,334,05521,905,0001,016,0002,117,632stderr
5Aug 14, 2026 22:372,80232,067,91121,953,0001,028,0002,117,632stderr
6Aug 14, 2026 22:372,80332,117,91421,972,0001,014,0002,117,632stderr
7Aug 14, 2026 22:372,80731,585,86821,971,0001,052,0002,117,632stderr
8Aug 14, 2026 22:372,80831,471,75221,995,0001,033,0002,117,632stderr
9Aug 14, 2026 22:372,81831,359,55822,045,0001,065,0002,117,632stderr