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 21, 2021 11:39Sergey StreminSergey StreminScore: 295,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 11:39211,4781,105,586,0461,036,240,80902,211,840
2May 21, 2021 11:39214,9631,121,708,7181,053,320,16602,199,552
3May 21, 2021 11:39215,0031,124,728,1371,053,514,31702,187,264
4May 21, 2021 11:39295,9261,504,610,0321,450,037,83902,195,456
5May 21, 2021 11:39295,9281,514,673,1451,450,045,58802,195,456
6May 21, 2021 11:39295,9321,540,599,4421,450,066,26702,191,360