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:23Victor MerckléVictor MerckléScore: 2,569Success
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:242,54929,202,11320,907,000024,576stderr
2Sep 8, 2026 13:242,55629,278,72520,965,000024,576stderr
3Sep 8, 2026 13:242,56029,204,86820,998,000024,576stderr
4Sep 8, 2026 13:242,56129,219,02321,002,000024,576stderr
5Sep 8, 2026 13:242,56929,470,87020,034,0001,034,00024,576stderr
6Sep 8, 2026 13:242,64330,063,08021,673,000024,576stderr
7Sep 8, 2026 13:242,64430,817,13821,683,000024,576stderr
8Sep 8, 2026 13:242,64930,750,09221,723,000024,576stderr
9Sep 8, 2026 13:245,47253,068,67543,859,0001,015,00024,576stderr