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 22:47Andrey LikhachevAndrey LikhachevScore: 36,927Success
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 22:4736,421355,690,990298,648,46802,220,032
2Jun 22, 2024 22:4736,927369,482,437302,799,05502,281,472
3Jun 22, 2024 22:4738,432375,717,133315,140,40702,211,840