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 24, 2026 14:18Dominique GarmierDominique GarmierScore: 10,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 14:1710,218107,491,90182,789,000997,0002,449,408
2Mar 24, 2026 14:1710,258111,102,56282,117,0002,002,0002,473,984
3Mar 24, 2026 14:1810,260108,714,34381,126,0003,004,0002,473,984
4Mar 24, 2026 14:1810,283111,016,87082,315,0002,007,0002,289,664
5Mar 24, 2026 14:1710,306115,381,46783,500,0001,006,0002,519,040
6Mar 24, 2026 14:1810,432112,797,48583,530,0002,012,0002,383,872