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 4, 2022 15:04Robert BurkeRobert BurkeScore: 60,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2022 15:0459,536313,215,021289,727,0001,998,0002,449,408
2Oct 4, 2022 15:0459,551314,765,770289,800,0001,998,0002,281,472
3Oct 4, 2022 15:0459,583314,468,000289,959,0001,999,0002,281,472
4Oct 4, 2022 15:0459,619320,929,874290,131,0002,000,0002,281,472
5Oct 4, 2022 15:0459,662310,286,366291,344,0001,001,0002,535,424
6Oct 4, 2022 15:0459,730321,751,026290,678,0001,997,0002,445,312
7Oct 4, 2022 15:0460,546318,166,909294,679,0001,997,0002,441,216
8Oct 4, 2022 15:0462,715329,971,516306,305,0001,000,0002,281,472
9Oct 4, 2022 15:0463,312383,613,565310,229,65302,183,168
10Oct 4, 2022 15:0463,329374,502,797310,311,36802,174,976
11Oct 4, 2022 15:0463,393377,054,218310,623,46802,174,976
12Oct 4, 2022 15:0467,511355,253,636328,805,0001,998,0002,449,408