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 listSep 7, 2026 16:54Victor MerckléVictor MerckléScore: 2,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:562,59029,692,50321,243,000024,576stderr
2Sep 7, 2026 16:562,59730,398,26921,296,000024,576stderr
3Sep 7, 2026 16:562,60130,459,61721,334,000024,576stderr
4Sep 7, 2026 16:562,60229,820,60321,343,000024,576stderr
5Sep 7, 2026 16:562,60730,516,29620,368,0001,015,00024,576stderr
6Sep 7, 2026 16:565,25951,620,65042,113,0001,016,00024,576stderr
7Sep 7, 2026 16:565,26651,632,59542,173,0001,010,00024,576stderr
8Sep 7, 2026 16:565,28351,720,40142,304,0001,020,00024,576stderr
9Sep 7, 2026 16:565,28851,882,17142,356,0001,012,00024,576stderr