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 listJul 22, 2022 00:41Robert BurkeRobert BurkeScore: 70,293Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2022 00:4167,892391,505,261332,669,45002,289,664
2Jul 22, 2022 00:4167,916391,059,427332,786,24502,285,568
3Jul 22, 2022 00:4170,232369,562,297344,138,00002,519,040
4Jul 22, 2022 00:4170,261364,280,202344,278,00002,428,928
5Jul 22, 2022 00:4170,261364,007,693344,280,00002,428,928
6Jul 22, 2022 00:4170,278369,374,504343,359,0001,001,0002,281,472
7Jul 22, 2022 00:4170,293370,792,960343,434,0001,001,0002,433,024
8Jul 22, 2022 00:4170,338363,053,896343,656,000999,0002,428,928
9Jul 22, 2022 00:4170,398368,335,672342,952,0001,999,0002,281,472
10Jul 22, 2022 00:4170,629369,159,801344,084,0002,000,0002,424,832
11Jul 22, 2022 00:4170,663403,249,174346,248,09902,285,568
12Jul 22, 2022 00:4178,504406,423,990382,670,0001,998,0002,420,736