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:52Yurkov AlekseyYurkov AlekseyScore: 643,584Success
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:52607,5943,040,983,0212,977,209,72202,269,184
2May 17, 2021 23:52607,6223,046,190,0682,977,346,25602,269,184
3May 17, 2021 23:52607,6523,036,707,3342,977,496,69602,269,184
4May 17, 2021 23:52643,5843,216,214,0673,153,560,67702,273,280
5May 17, 2021 23:52643,6243,214,798,2883,153,756,94702,273,280
6May 17, 2021 23:52643,6993,213,650,8333,154,123,52002,273,280