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 11:47Robert BurkeRobert BurkeScore: 61,635Success
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 11:4758,997349,632,087289,085,18702,174,976
2Oct 4, 2022 11:4759,044352,298,764289,316,77402,187,264
3Oct 4, 2022 11:4759,834355,475,172293,187,50802,179,072
4Oct 4, 2022 11:4761,608323,256,188299,880,0001,999,0002,281,472
5Oct 4, 2022 11:4761,609322,530,114299,887,0001,999,0002,531,328
6Oct 4, 2022 11:4761,619325,148,150299,936,0001,999,0002,281,472
7Oct 4, 2022 11:4761,635323,042,948300,012,0002,000,0002,281,472
8Oct 4, 2022 11:4761,681325,244,506301,238,0001,000,0002,281,472
9Oct 4, 2022 11:4761,764328,485,346301,648,000998,0002,449,408
10Oct 4, 2022 11:4762,021324,136,776301,905,0001,999,0002,281,472
11Oct 4, 2022 11:4762,134329,464,221303,458,0001,001,0002,453,504
12Oct 4, 2022 11:4762,666332,634,120305,062,0002,000,0002,445,312