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:29Robert BurkeRobert BurkeScore: 55,864Success
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:2955,757345,324,223273,207,02302,187,264
2Oct 4, 2022 15:2955,757331,391,337273,207,01702,179,072
3Oct 4, 2022 15:2955,852301,174,505271,677,0001,997,0002,441,216
4Oct 4, 2022 15:2955,857298,380,307272,700,000998,0002,441,216
5Oct 4, 2022 15:2955,860297,680,022271,716,0001,997,0002,449,408
6Oct 4, 2022 15:2955,864295,807,255271,737,0001,998,0002,445,312
7Oct 4, 2022 15:2955,864294,603,404271,737,0001,998,0002,281,472
8Oct 4, 2022 15:2955,918298,791,325271,997,0001,999,0002,281,472
9Oct 4, 2022 15:2955,924298,520,925272,028,0002,000,0002,535,424
10Oct 4, 2022 15:2956,669304,630,048275,679,0001,997,0002,281,472
11Oct 4, 2022 15:2957,814356,231,330283,288,76202,301,952
12Oct 4, 2022 15:2958,332305,773,268283,827,0001,998,0002,449,408