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 listAug 3, 2022 02:26Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 02:2600000Error: expected "1987082309 ", got "2378312406 "stderr
2Aug 3, 2022 02:2700000Error: expected "2265567163 ", got "2147483648 "stderr
3Aug 3, 2022 02:288,146625,080,88966,798,80602,220,032
4Aug 3, 2022 02:288,592628,138,03870,450,87602,203,648
5Aug 3, 2022 02:2810,755656,801,03188,187,00502,215,936