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 13, 2021 15:23Yurkov AlekseyYurkov AlekseyScore: 107,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 15:2383,427754,911,491684,097,83202,293,760
2Jun 13, 2021 15:23103,778912,889,503850,977,74602,289,664
3Jun 13, 2021 15:23105,015918,164,095861,123,84102,289,664
4Jun 13, 2021 15:23107,512966,339,312881,596,07502,301,952
5Jun 13, 2021 15:23115,6111,016,980,030948,012,40802,297,856
6Jun 13, 2021 15:23115,6821,012,606,157948,588,68902,174,976