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 listJun 23, 2026 16:53Victor MerckléVictor MerckléScore: 3,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 16:543,02232,401,19223,662,0001,126,0002,117,632stderr
2Jun 23, 2026 16:543,05132,645,77623,807,0001,218,0002,117,632stderr
3Jun 23, 2026 16:543,06632,738,29824,026,0001,118,0002,117,632stderr
4Jun 23, 2026 16:543,07932,869,62424,031,0001,219,0002,117,632stderr
5Jun 23, 2026 16:543,09632,995,07524,224,0001,171,0002,117,632stderr
6Jun 23, 2026 16:543,09833,098,30624,212,0001,197,0002,117,632stderr
7Jun 23, 2026 16:543,20433,894,19725,101,0001,174,0002,117,632stderr
8Jun 23, 2026 16:5412,054106,852,63697,834,0001,011,0002,117,632stderr
9Jun 23, 2026 16:5412,389109,268,558100,589,0001,008,0002,117,632stderr