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 11:46Robert BurkeRobert BurkeScore: 62,375Success
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 11:4660,892366,475,998298,368,65502,187,264
2Oct 4, 2022 11:4660,905385,763,180298,433,01002,174,976
3Oct 4, 2022 11:4660,907359,460,707298,445,28902,179,072
4Oct 4, 2022 11:4662,281332,218,723304,177,0001,000,0002,281,472
5Oct 4, 2022 11:4662,361331,588,791303,574,0001,997,0002,441,216
6Oct 4, 2022 11:4662,370334,678,334304,616,000998,0002,281,472
7Oct 4, 2022 11:4662,375333,056,579304,634,0001,002,0002,445,312
8Oct 4, 2022 11:4662,460327,189,830305,055,0001,000,0002,449,408
9Oct 4, 2022 11:4662,705332,425,043306,254,0001,000,0002,441,216
10Oct 4, 2022 11:4662,764337,881,073306,542,0001,001,0002,281,472
11Oct 4, 2022 11:4662,866330,551,812306,043,0002,000,0002,281,472
12Oct 4, 2022 11:4663,599344,543,303310,635,000998,0002,441,216