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 listOct 13, 2021 17:53Sergey StreminSergey StreminScore: 12,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2021 17:5312,679158,484,079103,967,40102,293,760
2Oct 13, 2021 17:5312,726160,481,264104,356,26902,273,280
3Oct 13, 2021 17:5312,808169,245,541105,026,27702,273,280