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 20, 2023 12:04matsuoka-601matsuoka-601Score: 187,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2023 12:03186,740988,513,088915,026,78802,293,760
2Dec 20, 2023 12:04186,937991,577,793915,989,18202,306,048
3Dec 20, 2023 12:03187,243990,722,294917,492,28502,306,048
4Dec 20, 2023 12:04187,481994,323,954918,656,09902,301,952
5Dec 20, 2023 12:03187,4941,005,671,901918,721,17202,183,168
6Dec 20, 2023 12:04189,335987,292,705927,740,66502,306,048