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 18:42Yurkov AlekseyYurkov AlekseyScore: 42,468Success
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 18:4134,886341,266,835286,061,42102,301,952
2Jun 13, 2021 18:4136,980374,568,717303,233,43602,293,760
3Jun 13, 2021 18:4239,224379,832,441321,637,82602,301,952
4Jun 13, 2021 18:4242,468407,269,558348,241,24702,174,976
5Jun 13, 2021 18:4147,383443,907,853388,539,64102,248,704
6Jun 13, 2021 18:4249,032470,142,462402,062,56502,293,760