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 21, 2026 17:32Dominique GarmierDominique GarmierScore: 12,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:4212,419127,602,958100,836,000998,0002,375,680
2Mar 21, 2026 16:4212,424127,825,29099,878,0001,997,0002,367,488
3Mar 21, 2026 17:3212,427129,146,01198,904,0002,997,0002,351,104
4Mar 21, 2026 16:4212,428128,683,06999,911,0001,998,0002,412,544
5Mar 21, 2026 16:4212,431127,881,52599,936,0001,998,0002,371,584
6Mar 21, 2026 16:4212,437122,719,48799,983,0001,999,0002,322,432
7Mar 21, 2026 16:4212,441125,834,170101,017,0001,000,0002,527,232
8Mar 21, 2026 17:3212,443128,480,825101,031,0001,000,0002,392,064
9Mar 21, 2026 16:4212,450127,883,276100,090,0002,001,0002,424,832
10Mar 21, 2026 16:4212,474129,824,268100,281,0002,005,0002,441,216
11Mar 21, 2026 17:3212,489122,728,465101,406,0001,004,0002,433,024
12Mar 21, 2026 16:4212,513124,270,880101,600,0001,005,0002,330,624