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 listAug 23, 2026 14:33Victor MerckléVictor MerckléScore: 5,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 14:342,79332,019,55321,674,0001,234,0002,129,920stderr
2Aug 23, 2026 14:342,80731,231,87421,902,0001,121,0002,129,920stderr
3Aug 23, 2026 14:342,81332,058,04121,857,0001,216,0002,129,920stderr
4Aug 23, 2026 14:345,42552,753,89943,294,0001,196,0002,129,920stderr
5Aug 23, 2026 14:345,43052,592,26243,312,0001,215,0002,129,920stderr
6Aug 23, 2026 14:345,43652,955,20443,563,0001,016,0002,129,920stderr
7Aug 23, 2026 14:345,44552,901,77343,635,0001,016,0002,129,920stderr
8Aug 23, 2026 14:345,45654,365,88343,729,0001,016,0002,129,920stderr
9Aug 23, 2026 14:345,60054,013,35644,884,0001,041,0002,129,920stderr