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:23Robert BurkeRobert BurkeScore: 61,646Success
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:2359,011351,239,752289,152,40102,179,072
2Oct 4, 2022 12:2359,188343,764,204290,022,97802,179,072
3Oct 4, 2022 12:2359,871345,603,074293,366,28902,187,264
4Oct 4, 2022 12:2361,567327,562,441299,683,0001,997,0002,281,472
5Oct 4, 2022 12:2361,598325,111,355299,831,0001,998,0002,281,472
6Oct 4, 2022 12:2361,621319,026,395299,942,0001,999,0002,445,312
7Oct 4, 2022 12:2361,646321,212,861300,066,0002,000,0002,277,376
8Oct 4, 2022 12:2361,654331,229,299300,107,0002,000,0002,445,312
9Oct 4, 2022 12:2361,682327,069,712301,242,0001,000,0002,281,472
10Oct 4, 2022 12:2362,025326,372,878301,922,0001,999,0002,281,472
11Oct 4, 2022 12:2362,026331,356,680301,930,0001,999,0002,281,472
12Oct 4, 2022 12:2362,045324,838,669302,019,0002,000,0002,531,328