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 22, 2024 16:52AnSaAnSaScore: 147,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2024 16:52126,1021,105,189,0291,034,032,80102,174,976
2Jun 22, 2024 16:52147,6791,276,669,6401,210,967,67902,179,072
3Jun 22, 2024 16:52152,9131,309,500,1001,253,889,00502,301,952