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 listJan 2, 2026 04:44Rajarshi BasuRajarshi BasuScore: 88,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:449,102104,926,31072,616,0002,017,0002,297,856
2Jan 2, 2026 04:449,194105,414,02373,378,0002,010,0002,424,832
3Jan 2, 2026 04:449,857109,649,46677,832,0002,993,0002,412,544
4Jan 2, 2026 04:4410,170112,050,56475,353,0008,037,0002,400,256
5Jan 2, 2026 04:4481,537697,271,875542,677,000125,925,0002,424,832
6Jan 2, 2026 04:4482,998706,489,325564,654,000115,929,0002,457,600
7Jan 2, 2026 04:4488,780753,098,586598,179,000129,821,0002,285,568
8Jan 2, 2026 04:44101,693867,862,028716,042,000117,842,0002,510,848
9Jan 2, 2026 04:44101,836867,959,000718,189,000116,868,0002,371,584
10Jan 2, 2026 04:44106,532905,797,611753,626,000119,940,0002,359,296
11Jan 2, 2026 04:44108,239915,209,170782,613,000104,948,0002,281,472
12Jan 2, 2026 04:44108,395917,008,917775,988,000112,852,0002,506,752