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:32Joad NacerJoad NacerScore: 124,451Success
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:32124,219638,449,057606,673,0001,998,0002,531,328
2Dec 29, 2024 03:32124,358636,465,412609,352,00002,269,184
3Dec 29, 2024 03:32124,393640,408,710609,526,00002,424,832
4Dec 29, 2024 03:32124,403630,229,340608,577,000999,0002,424,832
5Dec 29, 2024 03:32124,451640,463,461607,812,0001,999,0002,428,928
6Dec 29, 2024 03:32124,452640,818,393607,818,0001,999,0002,531,328
7Dec 29, 2024 03:32124,513636,547,900609,116,0001,000,0002,531,328
8Dec 29, 2024 03:32124,542638,308,790610,254,00002,269,184
9Dec 29, 2024 03:32124,614633,977,740608,610,0001,998,0002,531,328