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 26, 2026 14:32Arseniy KorobenkoArseniy KorobenkoScore: 10,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 14:3210,038107,484,57681,310,0001,003,0002,359,296
2Mar 26, 2026 14:3210,049108,785,33279,390,0003,014,0002,383,872
3Mar 26, 2026 14:3210,051105,282,12278,400,0004,020,0002,310,144
4Mar 26, 2026 14:3210,056107,404,31780,445,0002,011,0002,469,888
5Mar 26, 2026 14:3210,068108,979,89181,554,0001,006,0002,310,144
6Mar 26, 2026 14:3210,075110,248,88978,584,0004,029,0002,523,136
7Mar 26, 2026 14:3210,095112,191,81181,778,000997,0002,498,560
8Mar 26, 2026 14:3210,099111,389,95981,802,0001,009,0002,310,144
9Mar 26, 2026 14:3210,152109,251,68781,243,0002,006,0002,379,776