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 23, 2024 10:43Andrey LikhachevAndrey LikhachevScore: 65,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2024 10:4363,844582,365,956523,517,07602,215,936
2Jun 23, 2024 10:4365,167605,217,335534,371,33302,293,760
3Jun 23, 2024 10:4369,734644,257,627571,818,84302,203,648