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 17:19AnSaAnSaScore: 125,034Success
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 17:19110,679971,872,263907,566,26902,306,048
2Jun 22, 2024 17:19125,0341,077,979,1201,025,280,13502,297,856
3Jun 22, 2024 17:19134,7371,166,778,4801,104,845,11202,306,048