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 listAug 23, 2026 18:25Victor MerckléVictor MerckléScore: 2,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:262,82031,428,79722,077,0001,055,0002,117,632stderr
2Aug 23, 2026 18:262,82431,891,38322,121,0001,038,0002,117,632stderr
3Aug 23, 2026 18:262,82431,500,53921,944,0001,218,0002,117,632stderr
4Aug 23, 2026 18:262,84331,658,82722,252,0001,068,0002,117,632stderr
5Aug 23, 2026 18:262,84731,719,00222,292,0001,059,0002,117,632stderr
6Aug 23, 2026 18:262,98732,820,29223,430,0001,067,0002,117,632stderr
7Aug 23, 2026 18:265,55354,502,09344,517,0001,023,0002,117,632stderr
8Aug 23, 2026 18:265,56054,547,65843,492,0002,106,0002,117,632stderr
9Aug 23, 2026 18:265,73455,335,66045,011,0002,015,0002,117,632stderr