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 15:51Victor MerckléVictor MerckléScore: 2,763Success
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 15:532,74330,981,08621,474,0001,022,0002,117,632stderr
2Aug 19, 2026 15:532,75830,928,64221,602,0001,020,0002,117,632stderr
3Aug 19, 2026 15:532,76130,970,15821,620,0001,025,0002,117,632stderr
4Aug 19, 2026 15:532,76231,794,57221,555,0001,097,0002,117,632stderr
5Aug 19, 2026 15:532,76330,802,72221,646,0001,011,0002,117,632stderr
6Aug 19, 2026 15:532,88539,006,39022,623,0001,042,0002,117,632stderr
7Aug 19, 2026 15:535,46753,877,85043,683,0001,153,0002,117,632stderr
8Aug 19, 2026 15:535,47354,448,19543,696,0001,188,0002,117,632stderr
9Aug 19, 2026 15:535,52954,262,98344,149,0001,192,0002,117,632stderr