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:52Robert BurkeRobert BurkeScore: 55,429Success
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:5252,942326,496,268259,417,14802,179,072
2Oct 4, 2022 15:5252,967327,144,095259,538,14402,179,072
3Oct 4, 2022 15:5252,973336,332,157259,569,94902,187,264
4Oct 4, 2022 15:5255,372290,813,529270,321,0001,001,0002,535,424
5Oct 4, 2022 15:5255,373291,933,442270,325,0001,001,0002,445,312
6Oct 4, 2022 15:5255,400297,044,529270,460,0001,001,0002,281,472
7Oct 4, 2022 15:5255,429298,959,528269,604,0001,997,0002,441,216
8Oct 4, 2022 15:5255,603298,848,616271,452,0001,001,0002,445,312
9Oct 4, 2022 15:5255,803300,757,470272,433,0001,001,0002,281,472
10Oct 4, 2022 15:5255,895295,487,119271,888,0001,999,0002,449,408
11Oct 4, 2022 15:5255,903301,120,521271,928,0001,999,0002,445,312
12Oct 4, 2022 15:5256,822306,000,750277,429,0001,001,0002,445,312