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 12:56Ulyanov AlekseyUlyanov AlekseyScore: 22,447Success
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:5622,445244,766,329184,049,50202,260,992
2Jun 15, 2023 12:5622,447243,269,342184,069,07002,269,184
3Jun 15, 2023 12:5622,486255,410,138184,383,11802,265,088