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 04:53Josu San MartinJosu San MartinScore: 3,763Success
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 04:533,64854,692,58325,928,0003,989,0002,498,560
2Feb 7, 2026 04:533,69559,749,11628,281,0002,020,0002,404,352
3Feb 7, 2026 04:533,75854,056,14428,830,0001,988,0002,322,432
4Feb 7, 2026 04:533,76053,998,28729,834,000994,0002,486,272
5Feb 7, 2026 04:533,76362,035,42228,864,0001,990,0002,306,048
6Feb 7, 2026 04:533,77358,344,50027,944,0002,994,0002,375,680
7Feb 7, 2026 04:533,83756,833,37030,447,0001,014,0002,396,160
8Feb 7, 2026 04:533,95051,146,14429,357,0003,036,0002,318,336
9Feb 7, 2026 04:5311,306119,652,46390,698,0002,015,0002,449,408