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 12:22Robert BurkeRobert BurkeScore: 55,767Success
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 12:2253,017314,599,551259,780,93202,179,072
2Oct 4, 2022 12:2253,025320,345,125259,820,84902,191,360
3Oct 4, 2022 12:2255,733297,006,935272,093,0001,000,0002,441,216
4Oct 4, 2022 12:2255,744292,480,992272,145,0001,000,0002,281,472
5Oct 4, 2022 12:2255,749300,992,480272,169,0001,000,0002,281,472
6Oct 4, 2022 12:2255,758299,083,206272,213,0001,000,0002,445,312
7Oct 4, 2022 12:2255,767295,571,662272,260,0001,000,0002,441,216
8Oct 4, 2022 12:2255,774295,190,929272,290,0001,001,0002,281,472
9Oct 4, 2022 12:2255,856302,276,210272,694,000998,0002,449,408
10Oct 4, 2022 12:2255,955299,076,170273,181,0001,000,0002,281,472
11Oct 4, 2022 12:2256,019303,714,344272,497,0001,996,0002,445,312
12Oct 4, 2022 12:2256,731340,800,832277,981,96502,174,976