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 17, 2021 23:50Yurkov AlekseyYurkov AlekseyScore: 689,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 23:50659,3843,288,367,0973,230,983,99702,269,184
2May 17, 2021 23:50659,3853,291,324,9583,230,984,13602,273,280
3May 17, 2021 23:50659,4213,303,900,9383,231,160,85302,269,184
4May 17, 2021 23:50689,3923,440,849,5343,378,022,09302,273,280
5May 17, 2021 23:50689,3993,447,916,5903,378,055,48002,277,376
6May 17, 2021 23:50689,4723,446,090,2783,378,413,85202,273,280