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 listJul 20, 2022 15:47Robert BurkeRobert BurkeScore: 83,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2022 15:4781,148449,624,831397,623,26402,289,664
2Jul 20, 2022 15:4781,178456,347,028397,773,12002,297,856
3Jul 20, 2022 15:4781,193461,043,556397,843,41702,285,568
4Jul 20, 2022 15:4783,216433,022,562406,760,000999,0002,281,472
5Jul 20, 2022 15:4783,233430,023,527406,842,000999,0002,281,472
6Jul 20, 2022 15:4783,249434,242,793405,921,0001,999,0002,281,472
7Jul 20, 2022 15:4783,269427,404,061406,018,0002,000,0002,277,376
8Jul 20, 2022 15:4783,271428,006,951407,029,0001,000,0002,433,024
9Jul 20, 2022 15:4783,271432,104,659407,030,0001,000,0002,433,024
10Jul 20, 2022 15:4783,294433,193,223408,140,00002,281,472
11Jul 20, 2022 15:4783,313430,388,038407,232,0001,000,0002,277,376
12Jul 20, 2022 15:47102,958526,855,266502,496,0001,997,0002,514,944