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 listFeb 1, 2025 17:54spacecat8086spacecat8086Score: 104,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 17:5481,023689,250,289524,515,000139,870,0002,338,816
2Feb 1, 2025 17:54104,423879,430,381718,386,000137,882,0002,416,640
3Feb 1, 2025 17:54131,3711,102,035,556938,344,000138,902,0002,404,352