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 25, 2026 04:18Dominique GarmierDominique GarmierScore: 20,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 00:1220,214190,472,070162,758,0002,995,0002,330,624
2Mar 25, 2026 00:1220,235192,119,097163,930,0001,999,0002,490,368
3Mar 25, 2026 04:1820,254192,040,070163,082,0003,001,0002,383,872
4Mar 25, 2026 04:1820,259189,282,620163,123,0003,002,0002,289,664
5Mar 25, 2026 04:1820,287192,615,811163,349,0003,006,0002,543,616
6Mar 25, 2026 00:1220,360193,569,504162,957,0003,998,0002,334,720