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,403Success
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:2252,958327,767,552259,493,18402,174,976
2Oct 4, 2022 12:2252,961317,125,010259,508,06102,179,072
3Oct 4, 2022 12:2255,367294,534,662270,297,0001,001,0002,281,472
4Oct 4, 2022 12:2255,377294,826,718270,347,0001,001,0002,445,312
5Oct 4, 2022 12:2255,380294,290,121270,359,0001,001,0002,281,472
6Oct 4, 2022 12:2255,390297,487,691270,410,0001,001,0002,281,472
7Oct 4, 2022 12:2255,403295,324,742269,479,0001,996,0002,441,216
8Oct 4, 2022 12:2255,411296,680,484270,512,0001,001,0002,281,472
9Oct 4, 2022 12:2255,820296,544,669272,518,0001,001,0002,281,472
10Oct 4, 2022 12:2255,911296,908,560271,967,0001,999,0002,445,312
11Oct 4, 2022 12:2255,980294,033,997273,302,0001,001,0002,281,472
12Oct 4, 2022 12:2256,312343,719,003275,927,83602,183,168