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 listDec 10, 2021 01:41Yuriy LyfenkoYuriy LyfenkoScore: 116,533Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 10, 2021 01:41114,112620,254,069559,149,07602,211,840
2Dec 10, 2021 01:41114,124634,025,478559,205,43902,322,432
3Dec 10, 2021 01:41114,549618,946,420561,291,35702,207,744
4Dec 10, 2021 01:41116,524597,094,090568,968,0001,999,0002,265,088
5Dec 10, 2021 01:41116,532601,980,100571,006,00002,330,624
6Dec 10, 2021 01:41116,532596,358,912571,008,00002,265,088
7Dec 10, 2021 01:41116,533595,364,725571,010,00002,342,912
8Dec 10, 2021 01:41116,642604,809,307570,549,000999,0002,334,720
9Dec 10, 2021 01:41116,859599,486,125571,611,000999,0002,527,232
10Dec 10, 2021 01:41116,944601,043,634572,024,0001,000,0002,265,088
11Dec 10, 2021 01:41116,988598,142,917573,240,00002,527,232
12Dec 10, 2021 01:41116,991600,141,002572,255,0001,000,0002,334,720