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:51Victor MerckléVictor MerckléScore: 2,625Success
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:522,55129,388,92020,925,000024,576stderr
2Sep 8, 2026 19:522,55329,483,32420,937,000024,576stderr
3Sep 8, 2026 19:522,56029,481,88821,000,000024,576stderr
4Sep 8, 2026 19:522,56129,469,14721,004,000024,576stderr
5Sep 8, 2026 19:522,62530,007,46021,533,000024,576stderr
6Sep 8, 2026 19:522,63229,975,49621,586,000024,576stderr
7Sep 8, 2026 19:522,63430,645,76721,603,000024,576stderr
8Sep 8, 2026 19:525,41852,859,21043,414,0001,015,00024,576stderr
9Sep 8, 2026 19:525,55354,557,97144,522,0001,017,00024,576stderr