A microcomputer bit addition verifying coded lock comprises the verifying process that a code M with a certain length is set; the code M is segmented: N1, N2, N3, N4...... Ni are set as the lengths of code segments, and meanwhile N1 & lt; N2 & lt; N3 & lt; N4...... & lt; Ni; the code segments at the first bit to the N1th bit of the code are named as M1, the code segments at the first bit to the N2th bit of the code are named as M2, the code segments at the first bit to the N3th bit of the code are named as M3,...... the code segments at the first bit to the Nith bit of the code are named as Mi; the code M1 is input during authentication, the authentication is passed if the input code is correct, if not, the code M2 is input, the authentication is passed if the input code M2 is correct, if not, the code M3 is input,...... till the final code segment Mi is input. The probability of mistakenly inputting code bit addition of a code possessor is very low for short codes, and the probability of mistakenly inputting code bit addition of a codebreaker is very high for long codes.