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 listDec 9, 2021 07:24Yuriy LyfenkoYuriy LyfenkoScore: 101,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2021 07:24101,560523,539,674496,645,000999,0002,334,720
2Dec 9, 2021 07:24101,565526,774,347495,671,0001,998,0002,265,088
3Dec 9, 2021 07:24101,606521,098,209496,871,000999,0002,265,088
4Dec 9, 2021 07:24101,608525,433,599495,881,0001,999,0002,265,088
5Dec 9, 2021 07:24101,610522,640,748495,888,0001,999,0002,334,720
6Dec 9, 2021 07:24101,613524,155,335496,904,000999,0002,338,816
7Dec 9, 2021 07:24101,613522,254,614495,907,0001,999,0002,269,184
8Dec 9, 2021 07:24101,625526,890,307495,962,0001,999,0002,342,912
9Dec 9, 2021 07:24101,645524,856,035496,062,0002,000,0002,527,232
10Dec 9, 2021 07:24102,200571,423,622500,778,00502,215,936
11Dec 9, 2021 07:24102,246579,054,983501,004,73302,211,840
12Dec 9, 2021 07:24102,447566,486,828501,988,73402,207,744