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 22:51Stanislav-PovolotskyStanislav-PovolotskyScore: 441,662Success
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 22:51411,0982,081,358,9162,014,378,24002,273,280
2May 3, 2021 22:51411,1952,077,174,9232,014,857,56502,265,088
3May 3, 2021 22:51411,4492,083,987,4132,016,098,63202,269,184
4May 3, 2021 22:51441,6622,225,420,2652,164,141,98802,269,184
5May 3, 2021 22:51441,9952,235,744,1302,165,773,12502,269,184
6May 3, 2021 22:51442,4052,237,451,8882,167,782,74902,265,088