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 listMay 10, 2026 10:08Pavel SkripkinPavel SkripkinScore: 25,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:084,41149,817,80332,816,0003,362,0002,322,432
2May 10, 2026 10:084,42149,481,87332,169,0004,091,0002,387,968
3May 10, 2026 10:084,48051,221,78532,579,0004,164,0002,482,176
4May 10, 2026 10:0825,627225,523,199206,973,0003,171,0002,547,712
5May 10, 2026 10:0825,859228,543,284208,800,0003,250,0002,338,816
6May 10, 2026 10:0825,869227,936,124208,077,0004,054,0002,519,040
7May 10, 2026 10:0826,121229,077,984209,965,0004,234,0002,560,000
8May 10, 2026 10:0826,193228,191,558211,596,0003,190,0002,424,832
9May 10, 2026 10:0826,196230,146,087211,619,0003,194,0002,318,336