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 14, 2023 22:08Ulyanov AlekseyUlyanov AlekseyScore: 28,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2023 22:1127,630283,063,141226,563,90802,273,280
2Jun 14, 2023 22:1128,394292,445,659232,827,81302,269,184
3Jun 14, 2023 22:1128,487300,936,660233,594,77602,256,896
4Jun 14, 2023 22:0828,730309,204,506235,588,99402,273,280
5Jun 14, 2023 22:0829,196316,560,197239,406,26202,269,184
6Jun 14, 2023 22:0829,257296,540,297239,906,70602,277,376