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 listFeb 7, 2026 05:14Josu San MartinJosu San MartinScore: 39,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 05:1335,609319,399,938287,991,0003,999,0002,494,464
2Feb 7, 2026 05:1438,240341,345,000311,569,0001,997,0002,392,064
3Feb 7, 2026 05:1439,079345,299,969318,447,0002,002,0002,445,312
4Feb 7, 2026 05:1339,175341,680,280317,237,0004,002,0002,347,008
5Feb 7, 2026 05:1439,233347,236,830317,715,0003,996,0002,334,720
6Feb 7, 2026 05:1439,344352,135,760320,624,0001,997,0002,473,984
7Feb 7, 2026 05:1439,347348,906,222320,640,0002,004,0002,461,696
8Feb 7, 2026 05:1440,281356,857,891328,302,0002,001,0002,416,640
9Feb 7, 2026 05:1340,584360,011,535330,790,0001,998,0002,490,368