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 03:25Joad NacerJoad NacerScore: 127,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 03:25126,906645,136,933619,842,0001,999,0002,531,328
2Dec 29, 2024 03:25127,008647,567,564621,342,000998,0002,269,184
3Dec 29, 2024 03:25127,027648,002,227621,435,000999,0002,269,184
4Dec 29, 2024 03:25127,030649,595,296621,450,000999,0002,269,184
5Dec 29, 2024 03:25127,044648,596,676621,518,000999,0002,531,328
6Dec 29, 2024 03:25127,047650,304,740622,528,00002,269,184
7Dec 29, 2024 03:25127,048647,519,925620,537,0001,998,0002,269,184
8Dec 29, 2024 03:25127,090646,545,696621,744,000999,0002,269,184
9Dec 29, 2024 03:25127,222642,514,416621,392,0001,998,0002,531,328