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 11:13Victor MerckléVictor MerckléScore: 5,388Success
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 11:152,74930,899,57621,450,0001,096,0002,117,632stderr
2Aug 29, 2026 11:152,75030,685,25721,540,0001,017,0002,117,632stderr
3Aug 29, 2026 11:152,76030,760,71521,614,0001,021,0002,117,632stderr
4Aug 29, 2026 11:155,37052,205,79442,989,0001,049,0002,117,632stderr
5Aug 29, 2026 11:155,38852,554,55943,145,0001,038,0002,117,632stderr
6Aug 29, 2026 11:155,40652,657,02143,300,0001,031,0002,117,632stderr
7Aug 29, 2026 11:155,42152,630,44843,337,0001,120,0002,117,632stderr
8Aug 29, 2026 11:155,43352,711,15343,504,0001,048,0002,117,632stderr
9Aug 29, 2026 11:155,49753,497,19143,916,0001,163,0002,117,632stderr