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 14, 2023 21:03Ulyanov AlekseyUlyanov AlekseyScore: 50,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2023 21:0349,906471,261,767409,229,56602,289,664
2Jun 14, 2023 21:0350,225476,480,575411,845,06502,293,760
3Jun 14, 2023 21:0350,589487,786,501414,831,65302,289,664