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 19, 2021 13:19alex3dalex3dScore: 130,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 13:19104,218908,264,827854,587,90802,203,648
2Jun 19, 2021 13:19130,0241,118,987,4241,066,198,01502,297,856
3Jun 19, 2021 13:19130,3201,129,184,2011,068,625,67202,240,512