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 13:27Victor MerckléVictor MerckléScore: 2,770Success
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 13:302,71530,603,01821,175,0001,089,0002,117,632stderr
2Aug 29, 2026 13:302,73230,536,82621,280,0001,127,0002,117,632stderr
3Aug 29, 2026 13:302,73630,652,67821,318,0001,124,0002,117,632stderr
4Aug 29, 2026 13:302,74530,659,92721,495,0001,017,0002,117,632stderr
5Aug 29, 2026 13:302,77030,856,24321,680,0001,039,0002,117,632stderr
6Aug 29, 2026 13:302,80831,084,94821,910,0001,119,0002,117,632stderr
7Aug 29, 2026 13:305,38952,588,65843,162,0001,035,0002,117,632stderr
8Aug 29, 2026 13:305,40952,492,22643,238,0001,118,0002,117,632stderr
9Aug 29, 2026 13:305,44152,784,20443,498,0001,124,0002,117,632stderr