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 29, 2026 10:18Victor MerckléVictor MerckléScore: 2,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:192,80231,351,49721,757,0001,222,0002,117,632stderr
2Aug 29, 2026 10:192,80431,298,14121,798,0001,198,0002,117,632stderr
3Aug 29, 2026 10:192,80631,354,13321,700,0001,312,0002,117,632stderr
4Aug 29, 2026 10:192,81031,384,18521,841,0001,209,0002,117,632stderr
5Aug 29, 2026 10:192,81531,442,43021,847,0001,240,0002,117,632stderr
6Aug 29, 2026 10:192,82231,815,02621,823,0001,323,0002,117,632stderr
7Aug 29, 2026 10:192,83331,597,99522,208,0001,025,0002,117,632stderr
8Aug 29, 2026 10:195,49053,364,07344,002,0001,020,0002,117,632stderr
9Aug 29, 2026 10:195,88564,451,42047,227,0001,031,0002,117,632stderr