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 13:53Victor MerckléVictor MerckléScore: 2,712Success
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 13:542,69530,786,94922,105,000024,576stderr
2Sep 8, 2026 13:542,70130,372,07422,152,000024,576stderr
3Sep 8, 2026 13:542,70730,534,11222,204,000024,576stderr
4Sep 8, 2026 13:542,70730,567,96122,199,000024,576stderr
5Sep 8, 2026 13:542,71230,441,02022,241,000024,576stderr
6Sep 8, 2026 13:542,71530,614,84122,264,000024,576stderr
7Sep 8, 2026 13:542,72030,671,99822,307,000024,576stderr
8Sep 8, 2026 13:542,74031,052,89922,476,000024,576stderr
9Sep 8, 2026 13:5411,682104,811,40294,787,0001,006,00024,576stderr