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:58Robert BurkeRobert BurkeScore: 55,961Success
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:5855,603334,657,258272,454,23602,301,952
2Oct 4, 2022 11:5855,673330,969,227272,798,97802,183,168
3Oct 4, 2022 11:5855,693333,860,770272,893,85802,187,264
4Oct 4, 2022 11:5855,931299,554,540272,062,0002,000,0002,281,472
5Oct 4, 2022 11:5855,943297,867,137272,123,0002,000,0002,281,472
6Oct 4, 2022 11:5855,951300,671,991272,158,0002,001,0002,281,472
7Oct 4, 2022 11:5855,961297,626,977273,209,0001,000,0002,281,472
8Oct 4, 2022 11:5855,998300,356,092273,390,0001,001,0002,281,472
9Oct 4, 2022 11:5856,008303,914,039273,437,0001,001,0002,449,408
10Oct 4, 2022 11:5856,017305,971,335274,481,00002,441,216
11Oct 4, 2022 11:5856,052299,505,148272,658,0001,997,0002,281,472
12Oct 4, 2022 11:5856,686302,363,049275,762,0001,998,0002,281,472