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 listOct 13, 2022 00:33Kenneth MaplesKenneth MaplesScore: 4,170,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2022 00:334,161,04520,450,370,87620,389,121,50502,277,376
2Oct 13, 2022 00:334,170,17020,489,031,98020,433,831,07902,273,280
3Oct 13, 2022 00:335,208,82925,589,506,37325,523,264,23902,260,992