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 14, 2024 00:35zielajzielajScore: 12,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:3512,819125,975,35095,108,00010,011,0002,539,520
2Oct 14, 2024 00:3512,823130,693,49791,126,00014,019,0002,338,816
3Oct 14, 2024 00:3513,297139,011,05394,034,00015,005,0002,527,232