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 8, 2026 13:39Victor MerckléVictor MerckléScore: 2,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 13:422,55729,186,38920,972,000024,576stderr
2Sep 8, 2026 13:422,55829,207,48420,982,000024,576stderr
3Sep 8, 2026 13:422,55929,222,71320,989,000024,576stderr
4Sep 8, 2026 13:422,56029,398,28420,995,000024,576stderr
5Sep 8, 2026 13:422,57329,306,66921,106,000024,576stderr
6Sep 8, 2026 13:422,57729,458,11321,137,000024,576stderr
7Sep 8, 2026 13:422,58729,513,64521,219,000024,576stderr
8Sep 8, 2026 13:422,61229,738,38121,424,000024,576stderr
9Sep 8, 2026 13:4211,615103,468,58694,241,0001,006,00024,576stderr