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 listJul 16, 2023 21:21Yuriy LyfenkoYuriy LyfenkoScore: 6,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 21:216,233624,418,12251,108,53002,224,128
2Jul 16, 2023 21:216,286616,911,48551,546,88002,199,552
3Jul 16, 2023 21:216,404611,721,63852,511,20402,297,856