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 listJul 15, 2023 15:36Yuriy LyfenkoYuriy LyfenkoScore: 5,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 15:364,975573,699,65027,860,00012,935,0002,420,736
2Jul 15, 2023 15:365,034564,644,29635,235,0006,040,0002,326,528
3Jul 15, 2023 15:365,116570,388,67234,963,0006,992,0002,318,336
4Jul 15, 2023 15:365,130570,623,34835,059,0007,011,0002,306,048
5Jul 15, 2023 15:365,155571,802,48134,221,0008,052,0002,457,600
6Jul 15, 2023 15:365,222573,425,22836,846,0005,975,0002,383,872
7Jul 15, 2023 15:365,258605,768,94843,116,87402,220,032
8Jul 15, 2023 15:365,285572,545,95939,303,0004,031,0002,293,760
9Jul 15, 2023 15:365,310613,448,98943,545,59502,240,512
10Jul 15, 2023 15:365,355570,935,59334,929,0008,981,0002,314,240
11Jul 15, 2023 15:365,419611,323,72244,437,55602,265,088
12Jul 15, 2023 15:365,659571,644,95237,323,0009,078,0002,494,464