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 listDec 29, 2024 02:10Joad NacerJoad NacerScore: 159,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 02:27159,001806,449,322779,107,00002,269,184
2Dec 26, 2024 02:27159,011806,770,107779,154,00002,531,328
3Dec 26, 2024 02:27159,011803,734,413777,158,0001,997,0002,424,832
4Dec 26, 2024 02:27159,019801,013,772779,192,00002,531,328
5Dec 26, 2024 02:27159,032801,164,577778,256,000999,0002,531,328
6Dec 26, 2024 02:27159,067808,600,475778,431,000999,0002,531,328
7Dec 26, 2024 02:33159,174798,236,902778,955,000999,0002,269,184
8Dec 26, 2024 02:33159,361803,964,822780,870,00002,531,328
9Dec 26, 2024 02:27159,378809,297,358780,951,00002,424,832
10Dec 26, 2024 02:33159,417807,374,510781,144,00002,510,848
11Dec 29, 2024 02:10159,425812,598,784781,181,00002,433,024
12Dec 26, 2024 02:27159,435809,525,215779,233,0001,998,0002,424,832
13Dec 26, 2024 02:27159,444808,083,251781,274,00002,531,328
14Dec 29, 2024 02:10159,465808,668,344780,379,000999,0002,531,328
15Dec 29, 2024 02:10159,476808,441,358780,435,000999,0002,424,832