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 listSep 1, 2026 11:19Victor MerckléVictor MerckléScore: 2,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 11:202,71430,741,18721,201,0001,055,0002,117,632stderr
2Sep 1, 2026 11:202,72330,962,59921,269,0001,060,0002,117,632stderr
3Sep 1, 2026 11:202,72830,790,76921,237,0001,140,0002,117,632stderr
4Sep 1, 2026 11:202,72930,794,51321,310,0001,074,0002,117,632stderr
5Sep 1, 2026 11:202,73230,738,53921,349,0001,056,0002,117,632stderr
6Sep 1, 2026 11:202,73530,791,34921,357,0001,073,0002,117,632stderr
7Sep 1, 2026 11:202,74031,552,64321,405,0001,064,0002,117,632stderr
8Sep 1, 2026 11:205,40052,707,30743,268,0001,019,0002,117,632stderr
9Sep 1, 2026 11:205,47353,910,84343,860,0001,025,0002,117,632stderr