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 07:45Victor MerckléVictor MerckléScore: 22,053Success
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 07:4619,251166,244,76921,970,000135,893,00024,576stderr
2Sep 8, 2026 07:4619,621169,260,20222,137,000138,760,00024,576stderr
3Sep 8, 2026 07:4619,750170,284,54621,740,000140,217,00024,576stderr
4Sep 8, 2026 07:4619,810172,165,90321,792,000140,650,00024,576stderr
5Sep 8, 2026 07:4622,053189,153,74945,613,000135,226,00024,576stderr
6Sep 8, 2026 07:4622,170190,235,16044,725,000137,075,00024,576stderr
7Sep 8, 2026 07:4622,919196,352,44344,048,000143,894,00024,576stderr
8Sep 8, 2026 07:4623,303199,523,16744,198,000146,894,00024,576stderr
9Sep 8, 2026 07:4623,550201,515,38644,101,000149,011,00024,576stderr