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 listJun 23, 2026 21:59Victor MerckléVictor MerckléScore: 12,088Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 22:013,15733,489,90724,648,0001,241,0002,117,632stderr
2Jun 23, 2026 22:013,16033,316,00524,638,0001,275,0002,117,632stderr
3Jun 23, 2026 22:013,20435,193,83025,012,0001,268,0002,117,632stderr
4Jun 23, 2026 22:013,22934,425,65725,179,0001,299,0002,117,632stderr
5Jun 23, 2026 22:0112,088106,756,33998,107,0001,018,0002,117,632stderr
6Jun 23, 2026 22:0112,130107,055,94598,452,0001,016,0002,117,632stderr
7Jun 23, 2026 22:0112,132107,177,25398,467,0001,018,0002,117,632stderr
8Jun 23, 2026 22:0112,256108,103,79699,483,0001,018,0002,117,632stderr
9Jun 23, 2026 22:0112,398109,251,812100,653,0001,016,0002,117,632stderr