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 20, 2021 12:28Andrey TsvetkovAndrey TsvetkovScore: 134,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 12:28124,8371,088,689,2951,023,660,87602,203,648
2Jun 20, 2021 12:28134,0871,160,426,0321,099,516,77902,211,840
3Jun 20, 2021 12:28135,0091,163,404,2871,107,077,03902,215,936