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 listApr 16, 2023 22:57Franek KortaFranek KortaScore: 15,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2023 22:5715,406182,454,457126,332,57502,265,088
2Apr 16, 2023 22:5715,676192,704,763128,540,22602,297,856
3Apr 16, 2023 22:5715,956207,380,369130,838,18602,191,360