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 listOct 19, 2024 18:23zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2024 18:2100000Error: No answer to stdout. Died or killed?stderr
2Oct 19, 2024 18:233,25351,749,56422,571,0004,103,0002,396,160
3Oct 19, 2024 18:233,27650,711,28624,871,0001,989,0002,453,504
4Oct 19, 2024 18:233,28149,854,63823,916,0002,989,0002,498,560
5Oct 19, 2024 18:233,28344,916,28725,923,000997,0002,383,872
6Oct 19, 2024 18:233,29049,784,90721,982,0004,996,0002,523,136
7Oct 19, 2024 18:233,29253,490,60425,992,000999,0002,510,848
8Oct 19, 2024 18:233,33554,008,96023,298,0004,051,0002,498,560
9Oct 19, 2024 18:233,34352,797,01225,383,0002,030,0002,457,600
10Oct 19, 2024 18:233,34661,109,46127,441,00002,351,104