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 12, 2021 17:40Yuriy LyfenkoYuriy LyfenkoScore: 33,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 17:4032,498324,709,232266,485,09802,293,760
2Jun 12, 2021 17:4033,043329,777,742270,948,83302,289,664
3Jun 12, 2021 17:4033,172335,191,328272,009,55802,293,760
4Jun 12, 2021 17:4033,600341,457,718275,516,45202,289,664
5Jun 12, 2021 17:4034,802344,309,100285,377,23902,297,856
6Jun 12, 2021 17:4042,208398,710,494346,104,51602,297,856