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 24, 2021 08:38alex3dalex3dScore: 667,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 08:38574,5892,886,072,6862,815,485,35202,285,568
2May 24, 2021 08:38574,6432,896,331,5832,815,752,12602,265,088
3May 24, 2021 08:38574,6792,873,843,0892,815,928,33002,273,280
4May 24, 2021 08:38667,4583,340,208,2823,270,546,14602,260,992
5May 24, 2021 08:38667,5323,343,930,8563,270,907,90402,281,472
6May 24, 2021 08:38667,9353,329,741,1043,272,879,70302,269,184