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 listApr 26, 2026 18:28TudyMTudyMScore: 25,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:2825,354223,405,124205,908,0001,999,0002,371,584
2Apr 26, 2026 18:2825,386227,534,849207,168,0001,000,0002,367,488
3Apr 26, 2026 18:2825,390226,635,869207,203,0001,000,0002,375,680
4Apr 26, 2026 18:2825,399225,391,279207,272,0001,001,0002,371,584
5Apr 26, 2026 18:2825,404227,477,973207,316,0001,001,0002,367,488
6Apr 26, 2026 18:2825,412225,376,752207,378,0001,001,0002,367,488
7Apr 26, 2026 18:2825,476225,933,549204,911,0003,998,0002,359,296
8Apr 26, 2026 18:2825,492225,120,427207,042,0002,000,0002,445,312
9Apr 26, 2026 18:2825,502225,435,330207,119,0002,001,0002,367,488