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 listMar 10, 2026 22:22olliecrowolliecrowScore: 3,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 22:103,40256,998,70524,907,0002,988,0002,453,504
2Mar 10, 2026 22:103,40353,945,22425,910,0001,993,0002,433,024
3Mar 10, 2026 22:103,40951,527,80525,960,0001,996,0002,306,048
4Mar 10, 2026 22:103,41158,228,68925,972,0001,997,0002,506,752
5Mar 10, 2026 22:103,41552,683,29926,000,0002,000,0002,486,272
6Mar 10, 2026 22:103,42557,137,47225,075,0003,009,0002,428,928
7Mar 10, 2026 22:103,42957,995,91125,103,0003,012,0002,469,888
8Mar 10, 2026 22:223,43255,463,70926,134,0002,010,0002,433,024
9Mar 10, 2026 22:103,45253,205,91826,288,0002,022,0002,277,376
10Mar 10, 2026 22:2218,292173,300,995146,998,0002,999,0002,461,696
11Mar 10, 2026 22:2218,318177,065,225146,206,0004,005,0002,510,848
12Mar 10, 2026 22:1018,416179,208,929147,008,0004,000,0002,379,776