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 17, 2021 23:47Yurkov AlekseyYurkov AlekseyScore: 674,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 23:47640,8753,211,291,4383,140,288,60502,256,896
2May 17, 2021 23:47640,8883,199,612,3493,140,348,77002,252,800
3May 17, 2021 23:47640,9273,208,848,0423,140,542,11702,256,896
4May 17, 2021 23:47674,7153,373,053,0843,306,102,87002,252,800
5May 17, 2021 23:47674,7773,373,720,5083,306,407,79802,260,992
6May 17, 2021 23:47674,8103,369,742,6033,306,566,89602,252,800