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 24, 2026 06:47Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:470950,011,364849,171,00090,152,00020,480Exit with code 3: med=2118927949 fp=cc71e970390664b5 p0=611264997 h64:7aa67458658f68279d6916106426836ae6b669a6676245e95b859458157957e58c5a35c35ea60d62e64364e65d67e6a86b968a62d5d559d58257557156f5795a861767e6736055b95df6676af6525d15a65c35fc63765f66364261...stderr