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 5, 2021 16:54Dmitry KashtanovDmitry KashtanovScore: 2,838,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 16:542,718,50413,387,387,88513,320,670,73802,195,456
2May 5, 2021 16:542,723,71113,408,483,46913,346,182,00402,191,360
3May 5, 2021 16:542,725,55413,412,244,42013,355,213,62802,191,360
4May 5, 2021 16:542,838,60013,995,880,06613,909,140,78002,195,456
5May 5, 2021 16:542,841,61813,982,229,97513,923,928,22402,199,552
6May 5, 2021 16:542,841,85014,002,900,33113,925,067,26102,191,360