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:06Paul MasurelPaul MasurelScore: 58,463Success
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:0657,568538,629,769472,058,60602,301,952
2Jul 15, 2023 15:0657,580541,263,754472,154,46402,252,800
3Jul 15, 2023 15:0657,828552,008,407474,186,58202,277,376
4Jul 15, 2023 15:0657,866552,499,595474,503,76802,273,280
5Jul 15, 2023 15:0558,175533,547,209477,033,47402,191,360
6Jul 15, 2023 15:0658,380540,378,022478,718,87302,220,032
7Jul 15, 2023 15:0658,463549,797,304479,394,61702,285,568
8Jul 15, 2023 15:0558,489544,979,082479,609,12002,248,704
9Jul 15, 2023 15:0558,496546,579,480479,666,70002,236,416
10Jul 15, 2023 15:0658,508556,321,948479,761,85602,195,456
11Jul 15, 2023 15:0658,516543,620,856479,829,09302,256,896
12Jul 15, 2023 15:0658,553547,254,649480,137,54102,289,664