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 18, 2026 09:42Josu San MartinJosu San MartinScore: 3,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 09:433,37137,565,13626,597,0001,050,0002,117,632
2Aug 18, 2026 09:433,37837,573,59426,653,0001,054,0002,117,632
3Aug 18, 2026 09:433,37937,581,79326,647,0001,063,0002,117,632
4Aug 18, 2026 09:433,38937,693,15626,760,0001,035,0002,117,632
5Aug 18, 2026 09:433,40637,824,77126,896,0001,037,0002,117,632
6Aug 18, 2026 09:4311,460115,574,66992,969,0001,011,0002,117,632
7Aug 18, 2026 09:4311,464103,914,70791,905,0002,100,0002,117,632
8Aug 18, 2026 09:4311,626105,278,53893,300,0002,034,0002,117,632
9Aug 18, 2026 09:4311,718126,145,87594,005,0002,084,0002,117,632