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 14:23Victor MerckléVictor MerckléScore: 5,440Success
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 14:242,78230,938,52321,728,0001,090,0002,117,632stderr
2Aug 23, 2026 14:242,79531,296,68321,748,0001,174,0002,117,632stderr
3Aug 23, 2026 14:242,79931,294,29521,935,0001,020,0002,117,632stderr
4Aug 23, 2026 14:245,43652,906,15443,532,0001,046,0002,117,632stderr
5Aug 23, 2026 14:245,44052,723,14343,480,0001,133,0002,117,632stderr
6Aug 23, 2026 14:245,44452,939,25743,612,0001,035,0002,117,632stderr
7Aug 23, 2026 14:245,45553,511,02143,589,0001,149,0002,117,632stderr
8Aug 23, 2026 14:245,50753,534,25344,021,0001,142,0002,117,632stderr
9Aug 23, 2026 14:245,52954,282,26944,183,0001,159,0002,117,632stderr