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 12:25Robert BurkeRobert BurkeScore: 61,608Success
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 12:2558,940345,356,625288,806,84702,191,360
2Oct 4, 2022 12:2559,022344,211,323289,205,79002,183,168
3Oct 4, 2022 12:2559,418354,584,152291,146,45002,174,976
4Oct 4, 2022 12:2561,579321,868,498299,741,0001,998,0002,445,312
5Oct 4, 2022 12:2561,593328,558,205299,806,0001,998,0002,445,312
6Oct 4, 2022 12:2561,608320,904,839299,878,0001,999,0002,277,376
7Oct 4, 2022 12:2561,608328,567,132299,880,0001,999,0002,281,472
8Oct 4, 2022 12:2561,617319,015,883299,923,0001,999,0002,281,472
9Oct 4, 2022 12:2561,620325,786,580299,937,0001,999,0002,281,472
10Oct 4, 2022 12:2561,691322,842,513301,284,0001,000,0002,441,216
11Oct 4, 2022 12:2561,763328,246,446300,641,0001,997,0002,273,280
12Oct 4, 2022 12:2562,032325,430,020301,960,0001,999,0002,531,328