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 09:59Victor MerckléVictor MerckléScore: 2,653Success
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 10:022,61630,553,77821,459,000024,576stderr
2Sep 8, 2026 10:022,61931,231,63821,480,000024,576stderr
3Sep 8, 2026 10:022,62029,999,56321,491,000024,576stderr
4Sep 8, 2026 10:022,62930,689,09121,560,000024,576stderr
5Sep 8, 2026 10:022,65329,990,86020,639,0001,118,00024,576stderr
6Sep 8, 2026 10:022,65630,150,74120,643,0001,142,00024,576stderr
7Sep 8, 2026 10:022,68230,208,76920,968,0001,028,00024,576stderr
8Sep 8, 2026 10:022,73430,664,59121,305,0001,120,00024,576stderr
9Sep 8, 2026 10:022,78731,176,13821,368,0001,488,00024,576stderr