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 17, 2024 01:34Huy Duc LeHuy Duc LeScore: 102,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2024 01:3492,838832,804,249761,267,80702,297,856
2Feb 17, 2024 01:34102,804903,514,882842,990,52002,199,552
3Feb 17, 2024 01:34105,810939,902,765867,639,05402,293,760