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 3, 2026 13:46Victor MerckléVictor MerckléScore: 3,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 13:463,25834,803,04225,688,0001,032,0002,117,632stderr
2Aug 3, 2026 13:463,27835,928,94625,833,0001,048,0002,117,632stderr
3Aug 3, 2026 13:463,33535,443,07226,299,0001,054,0002,117,632stderr
4Aug 3, 2026 13:463,37235,912,36926,583,0001,072,0002,117,632stderr
5Aug 3, 2026 13:463,37736,752,74426,621,0001,075,0002,117,632stderr
6Aug 3, 2026 13:463,38136,811,19326,667,0001,064,0002,117,632stderr
7Aug 3, 2026 13:463,41937,065,38327,008,0001,034,0002,117,632stderr
8Aug 3, 2026 13:463,43736,603,11227,150,0001,036,0002,117,632stderr
9Aug 3, 2026 13:4612,164108,107,86797,638,0002,112,0002,117,632stderr