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:46Robert BurkeRobert BurkeScore: 55,395Success
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:4652,913323,136,319259,275,16702,187,264
2Oct 4, 2022 15:4652,933329,903,391259,372,62102,183,168
3Oct 4, 2022 15:4652,943321,057,181259,420,24202,187,264
4Oct 4, 2022 15:4655,347295,500,061270,200,0001,000,0002,281,472
5Oct 4, 2022 15:4655,368292,774,745269,307,0001,994,0002,531,328
6Oct 4, 2022 15:4655,393292,222,124270,424,0001,001,0002,281,472
7Oct 4, 2022 15:4655,395295,934,597270,433,0001,001,0002,449,408
8Oct 4, 2022 15:4655,400297,225,059269,462,0001,996,0002,441,216
9Oct 4, 2022 15:4655,668296,571,996270,777,0001,998,0002,441,216
10Oct 4, 2022 15:4655,682303,374,321270,844,0001,998,0002,441,216
11Oct 4, 2022 15:4655,841301,292,084271,625,0001,997,0002,445,312
12Oct 4, 2022 15:4655,985298,447,697273,327,0001,001,0002,441,216