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 10, 2026 04:24olliecrowolliecrowScore: 12,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 04:2411,968124,288,55296,138,0002,002,0002,424,832
2Mar 10, 2026 04:2411,987119,635,78597,294,0001,003,0002,461,696
3Mar 10, 2026 04:2411,993120,600,27497,338,0001,003,0002,428,928
4Mar 10, 2026 04:2412,002118,985,41296,406,0002,008,0002,461,696
5Mar 10, 2026 04:2412,016128,942,17297,528,0001,005,0002,469,888
6Mar 10, 2026 04:2412,029130,603,05197,632,0001,006,0002,416,640
7Mar 10, 2026 04:2412,040125,558,70997,734,000997,0002,433,024
8Mar 10, 2026 04:2412,046125,505,04596,783,0001,995,0002,404,352
9Mar 10, 2026 04:2412,050129,322,88296,815,0001,996,0002,428,928