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 listSep 3, 2022 23:45Eugene ZhydzetskiEugene ZhydzetskiScore: 245,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2022 23:40244,8721,275,187,1201,199,873,28302,211,840
2Sep 3, 2022 23:40244,9761,256,852,0001,200,380,34202,211,840
3Sep 3, 2022 23:45245,0231,267,160,3571,200,612,49702,211,840
4Sep 3, 2022 23:45245,0251,262,963,8641,200,620,84102,215,936
5Sep 3, 2022 23:40245,3451,265,028,8201,202,191,72602,207,744
6Sep 3, 2022 23:45245,4111,266,572,8901,202,513,69702,215,936