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 19, 2026 09:40Victor MerckléVictor MerckléScore: 5,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 09:462,98132,668,10023,398,0001,048,0002,117,632stderr
2Aug 19, 2026 09:462,99532,867,83023,502,0001,058,0002,117,632stderr
3Aug 19, 2026 09:463,03433,084,73223,859,0001,026,0002,117,632stderr
4Aug 19, 2026 09:465,58054,109,00444,741,0001,019,0002,117,632stderr
5Aug 19, 2026 09:465,60954,208,45644,973,0001,021,0002,117,632stderr
6Aug 19, 2026 09:465,62854,443,14245,133,0001,019,0002,117,632stderr
7Aug 19, 2026 09:465,63454,419,77845,179,0001,020,0002,117,632stderr
8Aug 19, 2026 09:465,64255,254,02645,246,0001,023,0002,117,632stderr
9Aug 19, 2026 09:465,72855,931,65545,953,0001,021,0002,117,632stderr