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 listSep 2, 2022 20:53Eugene ZhydzetskiEugene ZhydzetskiScore: 1,078,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2022 20:531,077,4195,366,375,7015,279,355,08802,220,032
2Sep 2, 2022 20:531,078,2155,353,446,1265,283,255,65502,211,840
3Sep 2, 2022 20:531,078,6625,355,114,2845,285,443,84502,203,648