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 11, 2021 20:12Yuriy LyfenkoYuriy LyfenkoScore: 124,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 20:12116,7281,024,404,298957,171,31602,310,144
2Jun 11, 2021 20:12124,7301,088,960,7641,022,787,97502,314,240
3Jun 11, 2021 20:12130,2041,129,320,6981,067,674,06602,301,952