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:26Victor MerckléVictor MerckléScore: 5,462Success
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:282,80831,269,01621,904,0001,129,0002,117,632stderr
2Aug 23, 2026 14:282,82031,218,24222,104,0001,028,0002,117,632stderr
3Aug 23, 2026 14:282,82931,322,30422,072,0001,126,0002,117,632stderr
4Aug 23, 2026 14:285,45753,019,69543,602,0001,152,0002,117,632stderr
5Aug 23, 2026 14:285,46253,841,02743,663,0001,133,0002,117,632stderr
6Aug 23, 2026 14:285,46252,890,90543,656,0001,135,0002,117,632stderr
7Aug 23, 2026 14:285,47053,170,43043,733,0001,125,0002,117,632stderr
8Aug 23, 2026 14:285,47453,207,47243,880,0001,014,0002,117,632stderr
9Aug 23, 2026 14:285,48253,253,21743,814,0001,143,0002,117,632stderr