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:37Victor MerckléVictor MerckléScore: 2,971Success
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:382,94432,446,25323,083,0001,065,0002,117,632stderr
2Aug 19, 2026 09:382,95632,553,31623,176,0001,068,0002,117,632stderr
3Aug 19, 2026 09:382,96132,580,00122,226,0002,056,0002,117,632stderr
4Aug 19, 2026 09:382,96432,607,74423,231,0001,075,0002,117,632stderr
5Aug 19, 2026 09:382,97132,636,11323,290,0001,075,0002,117,632stderr
6Aug 19, 2026 09:383,01033,659,54423,644,0001,041,0002,117,632stderr
7Aug 19, 2026 09:383,11934,634,36423,493,0002,083,0002,117,632stderr
8Aug 19, 2026 09:385,49354,110,82544,018,0001,029,0002,117,632stderr
9Aug 19, 2026 09:385,52854,995,41144,311,0001,025,0002,117,632stderr