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 listFeb 19, 2026 12:59Aleksei ShahoikaAleksei ShahoikaScore: 84,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 12:594,77165,506,21536,111,0003,009,0002,506,752
2Feb 19, 2026 12:484,83169,461,22638,602,0001,015,0002,449,408
3Feb 19, 2026 12:484,83571,083,54538,634,0001,016,0002,469,888
4Feb 19, 2026 12:484,83866,074,15339,668,00002,490,368
5Feb 19, 2026 12:484,86461,818,30237,891,0001,994,0002,482,176
6Feb 19, 2026 12:484,88070,496,36638,013,0002,000,0002,375,680
7Feb 19, 2026 12:4884,473715,936,758575,732,000116,945,0002,338,816
8Feb 19, 2026 12:4892,362785,805,788644,461,000112,905,0002,367,488
9Feb 19, 2026 12:4897,987828,647,507685,570,000117,926,0002,338,816
10Feb 19, 2026 12:59109,567930,182,666778,522,000119,926,0002,338,816
11Feb 19, 2026 12:48111,177937,584,176794,696,000116,955,0002,281,472
12Feb 19, 2026 12:59117,865988,994,355846,555,000119,937,0002,355,200