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 15, 2024 00:03zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 00:0200000Error: Exit with code 1: not a dynamic executable 0 4294967295 50000000 100000000 2004318071 2290649223 49579966 6583082 2004318071 2290649223 420034 6583104 1993954273 2051220503 0 1080819stderr
2Oct 15, 2024 00:035,34673,131,63328,893,00014,944,0002,297,856
3Oct 15, 2024 00:035,46873,149,11431,884,00012,953,0002,494,464
4Oct 15, 2024 00:035,49168,740,06428,018,00017,011,0002,486,272