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 9, 2021 07:21Yuriy LyfenkoYuriy LyfenkoScore: 109,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2021 07:21108,465604,595,080531,476,10902,207,744
2Dec 9, 2021 07:21108,482590,960,638531,562,41102,199,552
3Dec 9, 2021 07:21108,713594,432,095532,695,34302,195,456
4Dec 9, 2021 07:21109,027559,905,161533,233,0001,000,0002,347,008
5Dec 9, 2021 07:21109,130558,591,264532,737,0001,999,0002,527,232
6Dec 9, 2021 07:21109,191564,118,458534,038,0001,000,0002,342,912
7Dec 9, 2021 07:21109,200563,124,101535,078,00002,334,720
8Dec 9, 2021 07:21109,210557,101,898534,129,0001,000,0002,347,008
9Dec 9, 2021 07:21109,295564,146,894533,546,0001,998,0002,265,088
10Dec 9, 2021 07:21109,324560,929,343533,689,0001,998,0002,338,816
11Dec 9, 2021 07:21109,448558,905,667536,295,00002,338,816
12Dec 9, 2021 07:21109,884564,471,461536,436,0001,997,0002,334,720