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 4, 2026 01:04olliecrowolliecrowScore: 12,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 01:0412,207126,859,96899,094,0001,000,0002,412,544
2Mar 4, 2026 01:0412,214122,853,12697,153,0003,004,0002,424,832
3Mar 4, 2026 01:0412,216125,641,84397,163,0003,005,0002,465,792
4Mar 4, 2026 01:0412,216122,948,16097,166,0003,005,0002,457,600
5Mar 4, 2026 01:0412,230125,325,91399,287,0001,002,0002,412,544
6Mar 4, 2026 01:0412,246121,865,59898,411,0002,008,0002,420,736
7Mar 4, 2026 01:0412,251125,753,86098,452,0002,009,0002,404,352
8Mar 4, 2026 01:0412,262128,766,59599,547,0001,005,0002,396,160
9Mar 4, 2026 01:0412,297127,505,21698,840,0001,996,0002,441,216