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 18, 2026 04:50limanjun99limanjun99Score: 41,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:5039,315350,903,354320,383,0002,002,0002,330,624
2Mar 18, 2026 04:5039,505350,294,650321,944,0001,999,0002,416,640
3Mar 18, 2026 04:5040,153354,313,247325,263,0003,990,0002,326,528
4Mar 18, 2026 04:5040,855358,220,186331,013,0004,000,0002,506,752
5Mar 18, 2026 04:5041,820372,183,492339,926,0002,999,0002,306,048
6Mar 18, 2026 04:5042,313372,657,022343,964,0002,999,0002,416,640
7Mar 18, 2026 04:5043,271383,303,471351,823,0002,998,0002,441,216
8Mar 18, 2026 04:5044,084386,859,852359,487,0002,002,0002,371,584
9Mar 18, 2026 04:5044,424390,236,962361,276,0003,002,0002,273,280