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 08:15Yurkov AlekseyYurkov AlekseyScore: 977,618Success
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 08:15976,2318,064,329,2028,005,092,98002,281,472
2Jun 13, 2021 08:15977,6188,091,464,3058,016,467,70402,281,472
3Jun 13, 2021 08:15983,7468,124,967,2188,066,720,36702,285,568