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 listJul 9, 2021 04:23evgenikwtevgenikwtScore: 544,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2021 04:42544,0882,725,439,7802,666,032,62702,256,896
2Jul 9, 2021 04:42544,1412,738,396,2242,666,289,24702,252,800
3Jul 9, 2021 04:23544,1812,723,655,4712,666,485,56202,256,896
4Jul 9, 2021 04:23544,2222,724,977,3272,666,686,33602,252,800
5Jul 9, 2021 04:23544,2232,734,246,3902,666,694,48202,260,992
6Jul 9, 2021 04:42544,2402,752,839,5152,666,777,29602,248,704