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 23, 2024 10:51Andrey LikhachevAndrey LikhachevScore: 59,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2024 10:5159,135543,596,164484,907,87802,269,184
2Jun 23, 2024 10:5159,858551,724,972490,834,72502,191,360
3Jun 23, 2024 10:5161,772564,711,282506,529,98802,211,840