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 18:17Yuriy LyfenkoYuriy LyfenkoScore: 33,156Success
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 18:1632,025349,760,506262,608,64802,289,664
2Jun 12, 2021 18:1632,295324,677,455264,816,62102,232,320
3Jun 12, 2021 18:1732,934334,422,942270,061,46102,207,744
4Jun 12, 2021 18:1633,156335,618,180271,877,37602,297,856
5Jun 12, 2021 18:1733,979350,224,506278,623,91302,293,760
6Jun 12, 2021 18:1742,453418,955,610348,118,17602,289,664