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 8, 2024 10:34NicolasNicolasScore: 960,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2024 10:34952,2037,877,568,3287,808,063,06902,297,856
2Jun 8, 2024 10:34960,9787,936,588,9017,880,023,14102,281,472
3Jun 8, 2024 10:34962,7357,950,786,9267,894,428,92302,301,952