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 listMar 3, 2026 23:24olliecrowolliecrowScore: 17,677Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:2417,668170,281,524143,881,000999,0002,514,944
2Mar 3, 2026 23:2417,668171,463,665143,882,000999,0002,367,488
3Mar 3, 2026 23:2417,673166,321,750142,920,0001,998,0002,510,848
4Mar 3, 2026 23:2417,674173,343,526142,931,0001,999,0002,510,848
5Mar 3, 2026 23:2417,677173,224,534143,956,000999,0002,531,328
6Mar 3, 2026 23:2417,705169,529,462143,180,0002,002,0002,527,232
7Mar 3, 2026 23:2417,705171,725,445142,182,0003,003,0002,510,848
8Mar 3, 2026 23:2417,722168,707,449144,315,0001,002,0002,531,328
9Mar 3, 2026 23:2417,775177,812,262143,762,0001,996,0002,514,944