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 18:26Victor MerckléVictor MerckléScore: 2,559Success
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 18:322,55229,349,31420,934,000024,576stderr
2Sep 8, 2026 18:322,55429,245,07220,949,000024,576stderr
3Sep 8, 2026 18:322,55429,206,15420,948,000024,576stderr
4Sep 8, 2026 18:322,55429,205,53420,946,000024,576stderr
5Sep 8, 2026 18:322,55929,213,73520,986,000024,576stderr
6Sep 8, 2026 18:322,59529,706,11221,279,000024,576stderr
7Sep 8, 2026 18:322,65330,194,47521,755,000024,576stderr
8Sep 8, 2026 18:322,66130,309,59821,823,000024,576stderr
9Sep 8, 2026 18:325,37952,573,03843,097,0001,013,00024,576stderr