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 13, 2024 22:55zielajzielajScore: 5,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 22:555,77171,826,14435,243,00012,083,0002,482,176
2Oct 13, 2024 22:555,87570,510,06437,138,00011,041,0002,281,472
3Oct 13, 2024 22:555,87870,509,27136,147,00012,049,0002,482,176
4Oct 13, 2024 22:555,95475,519,79631,882,00016,937,0002,531,328
5Oct 13, 2024 22:555,97972,418,99138,022,00011,006,0002,514,944
6Oct 13, 2024 22:556,04880,821,18836,437,00013,158,0002,490,368
7Oct 13, 2024 22:556,10775,456,37236,056,00014,021,0002,494,464
8Oct 13, 2024 22:556,22077,157,02434,002,00017,001,0002,412,544
9Oct 13, 2024 22:556,26073,152,83739,252,00012,077,0002,351,104