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 listJun 8, 2021 20:09Dmitry DolgopolovDmitry DolgopolovScore: 184,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2021 20:10183,671964,320,956899,985,77402,174,976
2Jun 8, 2021 20:10184,058958,043,606901,885,13802,179,072
3Jun 8, 2021 20:10184,097966,141,519902,072,88402,179,072
4Jun 8, 2021 20:09184,192952,763,535902,540,14302,179,072
5Jun 8, 2021 20:10184,824970,923,737905,635,34702,170,880
6Jun 8, 2021 20:10188,351995,955,424922,922,03502,179,072
7Jun 8, 2021 20:10188,732987,801,742924,785,28502,301,952
8Jun 8, 2021 20:09189,167994,852,252926,917,50902,170,880
9Jun 8, 2021 20:09189,458992,895,565928,344,36602,179,072