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 09:18alex3dalex3dScore: 543,648Success
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 09:18505,2272,531,257,3822,475,613,87402,281,472
2May 24, 2021 09:18506,0532,560,619,7422,479,661,97202,273,280
3May 24, 2021 09:18507,9762,555,677,5792,489,083,03702,273,280
4May 24, 2021 09:18543,6482,734,848,2362,663,874,79402,273,280
5May 24, 2021 09:18544,1242,731,241,4762,666,208,93002,273,280
6May 24, 2021 09:18544,4312,727,333,7172,667,709,85602,277,376