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 22, 2021 18:45Andrey TsvetkovAndrey TsvetkovScore: 1,101,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 18:451,036,1205,139,442,0105,076,989,39702,220,032
2May 22, 2021 18:451,036,4215,129,433,9095,078,462,94402,215,936
3May 22, 2021 18:451,036,8785,132,516,1325,080,703,07602,207,744
4May 22, 2021 18:451,101,2575,469,002,1995,396,161,09502,220,032
5May 22, 2021 18:451,101,3715,481,567,5135,396,718,96302,211,840
6May 22, 2021 18:451,101,4015,463,022,1595,396,867,17602,211,840