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 12, 2021 14:09Yuriy LyfenkoYuriy LyfenkoScore: 1,143,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 14:091,140,9869,423,316,3559,356,083,86902,293,760
2Jun 12, 2021 14:091,143,9989,442,280,9849,380,784,57602,306,048
3Jun 12, 2021 14:091,145,7379,458,390,8519,395,047,30502,297,856