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 21:17Ulyanov AlekseyUlyanov AlekseyScore: 47,289Success
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 21:1846,063441,958,092377,719,92702,297,856
2Jun 14, 2023 21:1847,104444,500,663386,250,43602,301,952
3Jun 14, 2023 21:1747,214452,311,591387,157,74302,301,952
4Jun 14, 2023 21:1847,289455,837,441387,773,89102,207,744
5Jun 14, 2023 21:1747,482440,542,596389,352,87802,306,048
6Jun 14, 2023 21:1747,588444,361,789390,217,90202,301,952