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 listMay 3, 2021 20:57Dmitry DolgopolovDmitry DolgopolovScore: 482,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2021 20:57446,7042,249,484,2972,188,848,82602,248,704
2May 3, 2021 20:57446,7512,252,374,2182,189,081,94202,248,704
3May 3, 2021 20:57446,7792,246,143,5452,189,215,11802,244,608
4May 3, 2021 20:57482,6252,422,926,5432,364,861,53502,256,896
5May 3, 2021 20:57482,6532,425,316,7792,364,999,06902,252,800
6May 3, 2021 20:57482,7042,427,481,0172,365,247,36302,240,512