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 7, 2026 16:32Josu San MartinJosu San MartinScore: 15,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 22:146,76675,430,41652,454,0003,026,0002,482,176
2Feb 7, 2026 16:326,90280,045,27654,577,0002,021,0002,351,104
3Feb 7, 2026 22:146,90486,415,17654,589,0002,021,0002,465,792
4Feb 7, 2026 16:326,93288,733,83953,852,0002,991,0002,269,184
5Feb 7, 2026 16:326,94480,225,62954,942,0001,997,0002,506,752
6Feb 7, 2026 16:327,06882,407,70954,961,0002,997,0002,514,944
7Feb 7, 2026 16:3215,073152,046,783120,611,0002,990,0002,514,944
8Feb 7, 2026 16:3215,073152,886,654120,607,0002,990,0002,416,640
9Feb 7, 2026 16:3215,076146,768,261120,631,0002,990,0002,371,584
10Feb 7, 2026 22:1415,102149,469,832121,841,0001,997,0002,527,232
11Feb 7, 2026 16:3215,162148,517,777122,325,0002,005,0002,506,752
12Feb 7, 2026 16:3215,201150,881,545122,651,0001,994,0002,510,848