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 listSep 7, 2026 17:37Victor MerckléVictor MerckléScore: 3,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:382,60929,814,52021,396,000024,576stderr
2Sep 7, 2026 17:382,61529,687,89120,393,0001,054,00024,576stderr
3Sep 7, 2026 17:382,67930,386,72220,931,0001,037,00024,576stderr
4Sep 7, 2026 17:383,05133,225,80920,594,0004,431,00024,576stderr
5Sep 7, 2026 17:383,21335,003,39220,742,0005,607,00024,576stderr
6Sep 7, 2026 17:383,68938,538,22621,310,0008,942,00024,576stderr
7Sep 7, 2026 17:383,77139,165,53021,443,0009,484,00024,576stderr
8Sep 7, 2026 17:385,30552,639,22542,491,0001,015,00024,576stderr
9Sep 7, 2026 17:385,71055,201,04942,481,0004,345,00024,576stderr