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 13:09Victor MerckléVictor MerckléScore: 2,953Success
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 13:142,84131,556,33422,160,0001,138,0002,117,632stderr
2Aug 19, 2026 13:142,86931,812,50322,499,0001,028,0002,117,632stderr
3Aug 19, 2026 13:142,87231,728,83122,439,0001,116,0002,117,632stderr
4Aug 19, 2026 13:142,90632,084,91122,708,0001,129,0002,117,632stderr
5Aug 19, 2026 13:142,95333,176,35823,187,0001,033,0002,117,632stderr
6Aug 19, 2026 13:143,28535,177,44125,717,0001,224,0002,117,632stderr
7Aug 19, 2026 13:145,47954,510,00543,878,0001,050,0002,117,632stderr
8Aug 19, 2026 13:145,49553,385,47443,900,0001,165,0002,117,632stderr
9Aug 19, 2026 13:145,53754,431,76244,259,0001,149,0002,117,632stderr