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 3, 2026 06:18Josu San MartinJosu San MartinScore: 3,266Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 06:193,24236,533,03225,569,0001,022,0002,117,632
2Sep 3, 2026 06:193,24936,519,16825,353,0001,289,0002,117,632
3Sep 3, 2026 06:193,25137,383,07925,634,0001,027,0002,117,632
4Sep 3, 2026 06:193,25737,348,05625,418,0001,294,0002,117,632
5Sep 3, 2026 06:193,26636,662,26425,496,0001,288,0002,117,632
6Sep 3, 2026 06:193,30137,110,86925,786,0001,285,0002,117,632
7Sep 3, 2026 06:1911,333102,929,61491,804,0001,131,0002,117,632
8Sep 3, 2026 06:1911,340102,972,29891,981,0001,012,0002,117,632
9Sep 3, 2026 06:1911,358103,008,45092,125,0001,017,0002,117,632