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 15:34Victor MerckléVictor MerckléScore: 5,460Success
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 15:362,76030,888,85821,461,0001,171,0002,117,632stderr
2Aug 19, 2026 15:362,77831,029,71121,743,0001,042,0002,117,632stderr
3Aug 19, 2026 15:365,40052,551,26043,231,0001,049,0002,117,632stderr
4Aug 19, 2026 15:365,44853,637,28243,510,0001,166,0002,117,632stderr
5Aug 19, 2026 15:365,46053,088,95343,585,0001,192,0002,117,632stderr
6Aug 19, 2026 15:365,59154,273,97244,807,0001,041,0002,117,632stderr
7Aug 19, 2026 15:365,60761,263,85144,754,0001,229,0002,117,632stderr
8Aug 19, 2026 15:365,66663,780,44345,256,0001,208,0002,117,632stderr
9Aug 19, 2026 15:365,69667,333,44145,499,0001,209,0002,117,632stderr