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 9, 2021 07:51Yuriy LyfenkoYuriy LyfenkoScore: 100,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2021 07:5199,855554,393,126489,289,92102,199,552
2Dec 9, 2021 07:51100,147516,452,666488,721,0001,998,0002,265,088
3Dec 9, 2021 07:51100,153517,522,250488,750,0001,998,0002,338,816
4Dec 9, 2021 07:51100,162548,690,837490,794,60402,203,648
5Dec 9, 2021 07:51100,163517,064,134488,800,0001,999,0002,265,088
6Dec 9, 2021 07:51100,186515,243,725488,912,0001,999,0002,338,816
7Dec 9, 2021 07:51100,188517,680,613489,922,000999,0002,265,088
8Dec 9, 2021 07:51100,206514,869,647490,011,0001,000,0002,527,232
9Dec 9, 2021 07:51100,230522,426,018490,126,0001,000,0002,527,232
10Dec 9, 2021 07:51100,237517,903,497490,161,0001,000,0002,265,088
11Dec 9, 2021 07:51100,279527,584,859490,369,000998,0002,338,816
12Dec 9, 2021 07:51100,388561,494,452491,900,95202,199,552