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 8, 2026 14:13Victor MerckléVictor MerckléScore: 2,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 14:152,55529,179,79220,958,000024,576stderr
2Sep 8, 2026 14:152,57029,313,63921,081,000024,576stderr
3Sep 8, 2026 14:152,58935,814,36721,233,000024,576stderr
4Sep 8, 2026 14:152,60238,705,15821,344,000024,576stderr
5Sep 8, 2026 14:152,63829,938,29321,636,000024,576stderr
6Sep 8, 2026 14:152,66230,166,30221,836,000024,576stderr
7Sep 8, 2026 14:152,66639,236,20920,855,0001,008,00024,576stderr
8Sep 8, 2026 14:155,42652,833,56543,481,0001,016,00024,576stderr
9Sep 8, 2026 14:155,47353,213,62143,868,0001,013,00024,576stderr