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 4, 2026 08:30Victor MerckléVictor MerckléScore: 2,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:332,63129,815,90020,508,0001,067,0002,117,632stderr
2Sep 4, 2026 08:332,63830,035,07320,557,0001,080,0002,117,632stderr
3Sep 4, 2026 08:332,64629,883,74920,639,0001,064,0002,117,632stderr
4Sep 4, 2026 08:332,64730,114,64320,641,0001,067,0002,117,632stderr
5Sep 4, 2026 08:332,71731,493,57021,175,0001,109,0002,117,632stderr
6Sep 4, 2026 08:332,74031,074,38221,381,0001,091,0002,117,632stderr
7Sep 4, 2026 08:335,31151,753,02342,542,0001,015,0002,117,632stderr
8Sep 4, 2026 08:335,31351,695,72042,428,0001,143,0002,117,632stderr
9Sep 4, 2026 08:335,31752,034,12742,589,0001,014,0002,117,632stderr