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 13:23Andrey TsvetkovAndrey TsvetkovScore: 116,079Success
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 13:2185,661752,095,432702,423,38502,301,952
2Jun 20, 2021 13:21107,799944,974,265883,953,30502,306,048
3Jun 20, 2021 13:23111,224974,411,981912,040,35202,301,952
4Jun 20, 2021 13:23116,0791,268,055,199951,851,09402,281,472
5Jun 20, 2021 13:21120,4741,055,886,755987,886,59702,265,088
6Jun 20, 2021 13:23133,8551,387,904,4201,097,607,43702,297,856