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 15, 2021 19:17Sergey StreminSergey StreminScore: 14,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2021 19:1614,495193,758,766118,862,25602,289,664
2Jun 15, 2021 19:1714,506185,157,798118,950,21102,297,856
3Jun 15, 2021 19:1614,525185,830,141119,108,85602,281,472
4Jun 15, 2021 19:1714,557178,972,156119,370,55202,285,568
5Jun 15, 2021 19:1714,558175,926,764119,372,38702,277,376
6Jun 15, 2021 19:1614,591192,057,815119,647,78302,269,184