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 12:46Victor MerckléVictor MerckléScore: 5,301Success
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 12:472,64530,059,98020,611,0001,083,0002,117,632stderr
2Sep 1, 2026 12:472,64529,808,19420,612,0001,085,0002,117,632stderr
3Sep 1, 2026 12:475,26251,542,78542,139,0001,012,0002,117,632stderr
4Sep 1, 2026 12:475,29951,648,68042,442,0001,014,0002,117,632stderr
5Sep 1, 2026 12:475,30152,573,37842,453,0001,016,0002,117,632stderr
6Sep 1, 2026 12:475,30351,752,87142,474,0001,014,0002,117,632stderr
7Sep 1, 2026 12:475,30551,972,91242,490,0001,014,0002,117,632stderr
8Sep 1, 2026 12:475,30551,711,07142,490,0001,014,0002,117,632stderr
9Sep 1, 2026 12:475,31051,957,17042,526,0001,018,0002,117,632stderr