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 listJun 13, 2021 17:02Yuriy 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
1Jun 13, 2021 17:0200000Error: expected "2028458666 ", got "4281467510 "stderr
2Jun 13, 2021 17:026,701132,200,53354,949,54202,220,032
3Jun 13, 2021 17:026,744132,277,59455,302,02402,228,224
4Jun 13, 2021 17:026,746126,909,86755,320,24702,220,032