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 listAug 15, 2026 23:18marko1597marko1597Score: 144,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:35142,7431,180,579,5421,167,336,0003,158,0002,117,632stderr
2Aug 15, 2026 23:35143,3911,185,828,3851,172,662,0003,145,0002,117,632stderr
3Aug 15, 2026 23:35143,4651,186,760,4101,173,258,0003,160,0002,117,632stderr
4Aug 15, 2026 23:35144,0651,191,292,7601,178,133,0003,201,0002,117,632stderr
5Aug 15, 2026 23:35144,2071,192,357,3781,179,343,0003,161,0002,117,632stderr
6Aug 15, 2026 23:35144,6161,204,276,3341,182,615,0003,242,0002,117,632stderr
7Aug 15, 2026 23:35144,8921,198,031,1441,183,993,0004,122,0002,117,632stderr
8Aug 15, 2026 23:35145,7161,204,714,4621,191,799,0003,075,0002,117,632stderr
9Aug 15, 2026 23:35147,0541,215,733,4171,202,683,0003,166,0002,117,632stderr