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 3, 2026 22:24olliecrowolliecrowScore: 53,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:2452,316461,454,394255,997,000172,998,0002,523,136
2Mar 3, 2026 22:2452,906458,359,326262,895,000170,932,0002,347,008
3Mar 3, 2026 22:2453,030461,181,031259,906,000174,937,0002,387,968
4Mar 3, 2026 22:2453,085464,368,364260,580,000174,718,0002,416,640
5Mar 3, 2026 22:2453,330467,976,071263,579,000173,723,0002,396,160
6Mar 3, 2026 22:2453,507467,160,212260,858,000177,903,0002,293,760
7Mar 3, 2026 22:2453,608465,985,833263,752,000175,835,0002,420,736
8Mar 3, 2026 22:2453,624464,198,674264,831,000174,888,0002,310,144
9Mar 3, 2026 22:2453,799472,344,943262,092,000179,063,0002,490,368