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 listOct 4, 2022 15:57Robert BurkeRobert BurkeScore: 55,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2022 15:5752,951322,646,343259,459,62302,183,168
2Oct 4, 2022 15:5752,982327,497,814259,613,64002,191,360
3Oct 4, 2022 15:5754,465331,526,959266,880,57402,179,072
4Oct 4, 2022 15:5755,353291,755,863270,231,0001,000,0002,281,472
5Oct 4, 2022 15:5755,369294,109,886270,307,0001,001,0002,281,472
6Oct 4, 2022 15:5755,372294,243,946270,321,0001,001,0002,281,472
7Oct 4, 2022 15:5755,376293,195,540270,341,0001,001,0002,281,472
8Oct 4, 2022 15:5755,378297,366,865270,351,0001,001,0002,281,472
9Oct 4, 2022 15:5755,383300,557,439270,376,0001,001,0002,281,472
10Oct 4, 2022 15:5755,417294,991,316269,545,0001,996,0002,449,408
11Oct 4, 2022 15:5755,782299,674,334272,329,0001,001,0002,445,312
12Oct 4, 2022 15:5755,954297,120,988273,173,0001,000,0002,445,312