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 23, 2026 18:29Victor MerckléVictor MerckléScore: 2,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:302,75030,795,21621,459,0001,096,0002,117,632stderr
2Aug 23, 2026 18:302,76931,625,99021,697,0001,016,0002,117,632stderr
3Aug 23, 2026 18:302,77631,013,09121,744,0001,020,0002,117,632stderr
4Aug 23, 2026 18:302,77732,347,17421,750,0001,024,0002,117,632stderr
5Aug 23, 2026 18:302,80931,320,19621,960,0001,075,0002,117,632stderr
6Aug 23, 2026 18:305,38652,398,23643,094,0001,072,0002,117,632stderr
7Aug 23, 2026 18:305,38652,405,44343,133,0001,033,0002,117,632stderr
8Aug 23, 2026 18:305,44552,900,83843,566,0001,085,0002,117,632stderr
9Aug 23, 2026 18:305,45653,754,12143,728,0001,017,0002,117,632stderr