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:50Victor MerckléVictor MerckléScore: 2,779Success
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:532,74731,020,71721,517,0001,015,0002,117,632stderr
2Sep 4, 2026 08:532,75630,983,40121,587,0001,014,0002,117,632stderr
3Sep 4, 2026 08:532,76431,085,65421,603,0001,064,0002,117,632stderr
4Sep 4, 2026 08:532,76631,041,34421,658,0001,026,0002,117,632stderr
5Sep 4, 2026 08:532,77931,193,31821,725,0001,064,0002,117,632stderr
6Sep 4, 2026 08:532,94139,418,12023,090,0001,028,0002,117,632stderr
7Sep 4, 2026 08:535,42052,821,41443,283,0001,164,0002,117,632stderr
8Sep 4, 2026 08:535,42052,800,21243,301,0001,151,0002,117,632stderr
9Sep 4, 2026 08:535,45853,169,71843,517,0001,246,0002,117,632stderr