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:38zielajzielajError
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:4100000Error: Exit with code 1: not a dynamic executable 0 0 2285898936 2331711920 505099 727918 2314634159 2320742555 626566 101352stderr
2Oct 14, 2024 00:385,27066,209,37334,169,0009,044,0002,375,680
3Oct 14, 2024 00:385,35466,023,54530,931,00012,971,0002,383,872
4Oct 14, 2024 00:385,36365,461,97824,986,00018,989,0002,433,024
5Oct 14, 2024 00:385,37365,914,52429,040,00015,021,0002,486,272
6Oct 14, 2024 00:385,38073,633,86132,085,00012,031,0002,506,752
7Oct 14, 2024 00:385,40866,109,75032,254,00012,095,0002,510,848
8Oct 14, 2024 00:385,41967,651,89825,246,00019,187,0002,404,352
9Oct 14, 2024 00:385,58974,952,73533,875,00011,956,0002,301,952
10Oct 14, 2024 00:385,67671,808,01936,425,00010,118,0002,342,912