The Fletcher16, Fletcher32 and Fletcher64 algorithms

Fletcher.py

def Fletcher16(string):
    a = map(ord,string)
    b = [sum(a[:i])%255 for i in range(len(a)+1)]
    return (sum(b) << 8) | max(b)
def Fletcher32(string):
    a = map(ord,string)
    b = [sum(a[:i])%65535 for i in range(len(a)+1)]
    return (sum(b) << 16) | max(b)
def Fletcher64(string):
    a = map(ord,string)
    b = [sum(a[:i])%4294967295 for i in range(len(a)+1)]
    return (sum(b) << 32) | max(b)

For long inputs, this doesn't seem to work though. I compared the output against CyberChef's for the first paragraph from cipsum.com.

Here is another, less compact one: https://github.com/njaladan/hashpy/blob/master/hashpy/fletcherNbit.py

I think you have to apply modulo before summing.