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 listMay 10, 2026 10:09Pavel SkripkinPavel SkripkinScore: 4,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:104,30353,909,62332,120,0003,165,0002,478,080
2May 10, 2026 10:104,32451,939,62032,192,0003,270,0002,383,872
3May 10, 2026 10:104,36848,802,27432,467,0003,352,0002,347,008
4May 10, 2026 10:104,38151,566,87032,561,0003,364,0002,330,624
5May 10, 2026 10:104,38453,478,79232,561,0003,391,0002,420,736
6May 10, 2026 10:104,39949,535,77632,808,0003,271,0002,457,600
7May 10, 2026 10:104,50352,050,19532,737,0004,194,0002,506,752
8May 10, 2026 10:1025,730227,931,550207,971,0003,021,0002,318,336
9May 10, 2026 10:1026,079231,151,784210,829,0003,021,0002,424,832