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 26, 2026 16:38Dominique GarmierDominique GarmierScore: 212,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 19:22212,7341,772,147,4991,742,417,0001,999,0002,342,912
2Mar 26, 2026 19:22212,7581,770,889,9211,741,615,0002,999,0002,412,544
3Mar 26, 2026 20:35212,7951,775,487,0651,741,921,0002,998,0002,342,912
4Mar 26, 2026 19:22212,8351,773,580,4431,744,250,000999,0002,330,624
5Mar 26, 2026 16:38212,9651,775,948,3331,744,311,0001,999,0002,498,560
6Mar 26, 2026 20:35213,1761,775,567,1301,744,047,0003,997,0002,478,080
7Mar 26, 2026 16:38213,2251,777,247,7611,745,446,0002,999,0002,420,736
8Mar 26, 2026 20:35213,4161,779,027,4781,747,011,0002,998,0002,404,352
9Mar 26, 2026 16:38214,4951,786,808,4651,754,859,0003,997,0002,355,200