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 listNov 22, 2022 15:57Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2022 15:5700000Error: expected "2114922827 ", got "2"
2Nov 22, 2022 15:5700000Error: expected "2231489490 ", got "2"
3Nov 22, 2022 15:5700000Error: expected "2144704806 ", got "2"
4Nov 22, 2022 15:5800000Error: expected "2281811871 ", got "1"
5Nov 22, 2022 15:585,942106,900,67748,725,16502,285,568
6Nov 22, 2022 15:586,018111,883,05449,347,88302,191,360
7Nov 22, 2022 15:586,024113,045,86149,398,00902,306,048
8Nov 22, 2022 15:586,032115,850,16649,459,52002,220,032
9Nov 22, 2022 15:586,045106,621,66249,569,63402,289,664
10Nov 22, 2022 15:586,057110,589,45549,671,45202,269,184
11Nov 22, 2022 15:576,092110,369,08249,951,81002,273,280
12Nov 22, 2022 15:576,129106,035,92050,258,77402,240,512
13Nov 22, 2022 15:576,172120,368,07250,608,80802,281,472