Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listMay 4, 2021 06:22Ross HaughRoss HaughScore: 6,293,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2021 06:226,162,85630,260,232,58930,197,995,31302,256,896
2May 4, 2021 06:226,164,07530,255,447,89230,203,965,26302,248,704
3May 4, 2021 06:226,164,67030,259,236,98430,206,882,41502,265,088
4May 4, 2021 06:226,293,07430,905,075,29930,836,062,98002,252,800
5May 4, 2021 06:226,305,14830,950,553,32930,895,225,57302,244,608
6May 4, 2021 06:226,732,10633,048,010,57932,987,320,56002,248,704