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 23:16Andrey LikhachevAndrey LikhachevScore: 41,871Success
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 23:1636,468363,756,093299,036,74302,220,032
2Jun 22, 2024 23:1641,871418,408,353343,338,10402,220,032
3Jun 22, 2024 23:1643,482413,465,884356,552,03202,211,840