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 2, 2022 18:12Yuriy 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 2, 2022 18:1200000Error: expected "2286510545 ", got "2147483648 "stderr
2Aug 2, 2022 18:137,390126,751,19760,594,13402,224,128
3Aug 2, 2022 18:137,460127,986,10461,173,02902,220,032
4Aug 2, 2022 18:137,536111,998,87961,796,07502,220,032