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 15, 2021 17:02Dmitry DolgopolovDmitry DolgopolovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2021 17:0100000Error: expected "2047369766 ", got "2053091339 "stderr
2Jun 15, 2021 16:5922,944248,937,953188,143,59602,265,088
3Jun 15, 2021 16:5923,176249,953,907190,039,93002,301,952
4Jun 15, 2021 16:5923,268251,724,366190,798,03702,183,168
5Jun 15, 2021 17:0223,475266,205,949192,491,84502,301,952
6Jun 15, 2021 17:0223,481257,805,559192,547,20902,174,976
7Jun 15, 2021 17:0224,008251,150,633196,863,50802,174,976