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 15, 2023 13:02Ulyanov AlekseyUlyanov AlekseyScore: 22,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2023 12:5722,345247,467,115183,229,69802,269,184
2Jun 15, 2023 12:5722,434256,169,987183,955,85102,273,280
3Jun 15, 2023 13:0222,454245,912,626184,120,11202,260,992
4Jun 15, 2023 12:5722,474252,115,348184,284,71702,265,088
5Jun 15, 2023 13:0222,501253,306,212184,506,33502,269,184
6Jun 15, 2023 13:0222,583248,786,379185,181,22802,260,992