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 08:11Victor MerckléVictor MerckléScore: 2,615Success
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 08:122,59329,624,68321,268,000024,576stderr
2Sep 8, 2026 08:122,59529,458,19121,283,000024,576stderr
3Sep 8, 2026 08:122,59529,729,12821,281,000024,576stderr
4Sep 8, 2026 08:122,59829,654,13821,309,000024,576stderr
5Sep 8, 2026 08:122,61529,797,01920,439,0001,005,00024,576stderr
6Sep 8, 2026 08:125,33052,074,86742,696,0001,014,00024,576stderr
7Sep 8, 2026 08:125,33652,105,01042,747,0001,014,00024,576stderr
8Sep 8, 2026 08:125,36852,297,08643,006,0001,014,00024,576stderr
9Sep 8, 2026 08:125,37952,483,05643,092,0001,016,00024,576stderr