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 16, 2024 01:03zielajzielajScore: 4,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 01:034,18253,713,81332,278,0002,017,0002,478,080
2Oct 16, 2024 01:034,27458,719,87429,040,0006,008,0002,306,048
3Oct 16, 2024 01:034,29558,748,03532,198,0003,018,0002,424,832
4Oct 16, 2024 01:034,30858,949,80531,286,0004,036,0002,441,216
5Oct 16, 2024 01:034,33957,768,59626,429,0009,148,0002,338,816
6Oct 16, 2024 01:034,37162,612,10431,858,0003,982,0002,482,176
7Oct 16, 2024 01:034,44664,044,16928,357,0008,102,0002,351,104
8Oct 16, 2024 01:034,52058,874,49433,059,0004,007,0002,490,368
9Oct 16, 2024 01:034,66365,778,56431,194,0007,043,0002,367,488