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 listJul 9, 2021 12:18Yuriy LyfenkoYuriy LyfenkoScore: 114,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2021 12:18114,0281,089,402,765556,740,0001,999,0002,482,176
2Jul 9, 2021 12:18114,1401,090,282,066559,287,00002,478,080
3Jul 9, 2021 12:18114,3121,084,032,822560,130,00002,478,080
4Jul 9, 2021 12:18114,3751,086,883,279559,439,000998,0002,482,176
5Jul 9, 2021 12:18114,3881,089,109,671558,503,0001,998,0002,478,080
6Jul 9, 2021 12:18114,3931,091,369,498558,529,0001,998,0002,482,176
7Jul 9, 2021 12:18114,4261,082,478,757559,687,000999,0002,478,080
8Jul 9, 2021 12:18114,5291,088,531,648561,190,00002,478,080
9Jul 9, 2021 12:18114,5501,087,012,395560,295,0001,000,0002,478,080
10Jul 9, 2021 12:18125,8051,206,917,460616,443,60002,191,360
11Jul 9, 2021 12:18125,8931,173,376,457616,875,96102,195,456
12Jul 9, 2021 12:18126,2511,182,590,787618,628,98402,191,360