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 30, 2026 01:56Dominique GarmierDominique GarmierScore: 12,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 04:0312,502126,717,866100,504,0002,010,0002,437,120
2Mar 30, 2026 01:5612,540132,067,575101,833,000998,0002,428,928
3Mar 30, 2026 04:0312,543128,730,307100,856,0001,997,0002,416,640
4Mar 30, 2026 04:0712,552128,406,230100,932,0001,998,0002,416,640
5Mar 30, 2026 04:0712,553130,084,38299,940,0002,998,0002,404,352
6Mar 30, 2026 04:0312,558132,911,727101,974,000999,0002,347,008
7Mar 30, 2026 04:0712,567126,315,389101,051,0002,001,0002,400,256
8Mar 30, 2026 01:5612,569130,032,968102,065,0001,000,0002,412,544
9Mar 30, 2026 01:5612,598125,135,414101,296,0002,005,0002,473,984