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 20, 2021 14:16Andrey TsvetkovAndrey TsvetkovScore: 101,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 14:1582,916734,637,803679,913,64002,260,992
2Jun 20, 2021 14:1694,738841,116,309776,850,85602,252,800
3Jun 20, 2021 14:15100,507891,013,877824,158,24502,273,280
4Jun 20, 2021 14:16101,004891,536,650828,229,37702,252,800
5Jun 20, 2021 14:15101,752884,642,601834,366,09302,248,704
6Jun 20, 2021 14:16107,722939,018,723883,322,12802,269,184