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 20, 2026 03:08olliecrowolliecrowScore: 3,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:083,40253,496,66925,901,0001,992,0002,293,760
2Mar 20, 2026 02:493,40756,409,35526,939,000997,0002,289,664
3Mar 20, 2026 02:493,56256,934,17927,195,0002,014,0002,375,680
4Mar 20, 2026 02:493,58965,011,50625,372,0004,059,0002,347,008
5Mar 20, 2026 03:0818,368176,318,695147,624,0002,992,0002,396,160
6Mar 20, 2026 03:0818,372183,931,526145,660,0004,988,0002,400,256