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 19:20Victor MerckléVictor MerckléScore: 2,652Success
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 19:232,55630,640,95620,967,000024,576stderr
2Sep 8, 2026 19:232,56129,494,24021,007,000024,576stderr
3Sep 8, 2026 19:232,63830,183,56321,637,000024,576stderr
4Sep 8, 2026 19:232,64830,186,72521,721,000024,576stderr
5Sep 8, 2026 19:232,65232,747,91921,749,000024,576stderr
6Sep 8, 2026 19:232,66930,406,61021,891,000024,576stderr
7Sep 8, 2026 19:232,67435,106,77420,908,0001,021,00024,576stderr
8Sep 8, 2026 19:232,67530,498,20321,938,000024,576stderr
9Sep 8, 2026 19:235,37852,576,92043,087,0001,013,00024,576stderr