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:29Joad NacerJoad NacerScore: 126,461Success
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:29126,407640,684,817619,395,00002,424,832
2Dec 29, 2024 03:29126,420650,887,587618,458,000999,0002,269,184
3Dec 29, 2024 03:29126,438650,477,787617,547,0001,998,0002,531,328
4Dec 29, 2024 03:29126,449643,321,693618,600,000999,0002,269,184
5Dec 29, 2024 03:29126,461641,652,492618,658,000999,0002,269,184
6Dec 29, 2024 03:29126,492642,846,128618,810,000999,0002,531,328
7Dec 29, 2024 03:29126,527644,726,985617,985,0001,999,0002,428,928
8Dec 29, 2024 03:29126,536644,345,893619,024,0001,000,0002,420,736
9Dec 29, 2024 03:29126,562645,175,162619,152,0001,000,0002,420,736