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 26, 2024 02:03Joad NacerJoad NacerScore: 187,448Success
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:03187,356948,636,447918,045,00002,433,024
2Dec 26, 2024 02:03187,399948,424,647918,256,00002,420,736
3Dec 26, 2024 02:03187,427944,984,572917,392,000999,0002,424,832
4Dec 26, 2024 02:03187,430947,266,575916,410,0001,998,0002,269,184
5Dec 26, 2024 02:03187,448939,701,757916,496,0001,998,0002,510,848
6Dec 26, 2024 02:03187,464941,229,117916,573,0001,999,0002,269,184
7Dec 26, 2024 02:03187,478942,193,081917,642,000999,0002,510,848
8Dec 26, 2024 02:03187,537942,098,181917,930,000999,0002,437,120
9Dec 26, 2024 02:03187,568944,078,005919,082,00002,424,832