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 listApr 30, 2026 07:44Victor MerckléVictor MerckléScore: 79,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 07:4579,713674,489,549651,655,0001,998,0002,338,816stderr
2Apr 30, 2026 07:4579,717673,294,169649,685,0003,998,0002,359,296stderr
3Apr 30, 2026 07:4579,800678,010,531650,371,0003,996,0002,433,024stderr
4Apr 30, 2026 07:4579,833674,298,716650,639,0003,997,0002,555,904stderr
5Apr 30, 2026 07:4579,956669,861,436652,649,0002,998,0002,375,680stderr
6Apr 30, 2026 07:4580,081672,985,738654,672,0001,999,0002,506,752stderr
7Apr 30, 2026 07:4580,539682,710,320657,425,0002,997,0002,465,792stderr
8Apr 30, 2026 07:4580,585679,977,779658,802,0001,999,0002,408,448stderr
9Apr 30, 2026 07:4580,628676,975,821657,151,0004,000,0002,445,312stderr