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:01Andrey LikhachevAndrey LikhachevScore: 41,200Success
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:0137,226374,130,366305,250,79702,215,936
2Jun 22, 2024 23:0141,200402,245,999337,837,47002,224,128
3Jun 22, 2024 23:0141,480423,582,496340,138,87102,228,224