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 10:24Victor MerckléVictor MerckléScore: 2,932Success
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:252,67738,463,94221,956,000024,576stderr
2Sep 8, 2026 10:252,68236,476,10622,000,000024,576stderr
3Sep 8, 2026 10:252,68637,811,70322,032,000024,576stderr
4Sep 8, 2026 10:252,69738,698,22722,120,000024,576stderr
5Sep 8, 2026 10:252,93242,787,38722,680,0001,365,00024,576stderr
6Sep 8, 2026 10:252,95341,386,43821,040,0003,175,00024,576stderr
7Sep 8, 2026 10:253,70538,592,61921,361,0009,022,00024,576stderr
8Sep 8, 2026 10:254,15343,148,89421,671,00012,390,00024,576stderr
9Sep 8, 2026 10:256,52661,918,80543,721,0009,799,00024,576stderr