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 20, 2021 20:20Dmitry DolgopolovDmitry DolgopolovScore: 483,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2021 20:20444,3502,230,310,9982,177,313,51202,248,704
2May 20, 2021 20:20444,3812,243,087,3982,177,468,10902,256,896
3May 20, 2021 20:20444,4042,227,240,6242,177,580,39802,265,088
4May 20, 2021 20:20483,1142,428,339,4072,367,257,59902,244,608
5May 20, 2021 20:20483,1202,427,662,2892,367,287,92602,256,896
6May 20, 2021 20:20483,1622,427,499,2652,367,493,29402,265,088