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 20, 2022 15:09Yuriy LyfenkoYuriy LyfenkoScore: 97,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2022 15:0996,980542,658,217475,202,42902,203,648
2Jul 20, 2022 15:0996,987501,834,841475,234,00002,265,088
3Jul 20, 2022 15:0997,025502,634,787474,422,0001,000,0002,342,912
4Jul 20, 2022 15:0997,031505,972,225475,453,00002,527,232
5Jul 20, 2022 15:0997,046540,305,054475,526,97702,215,936
6Jul 20, 2022 15:0997,049511,530,102474,541,000999,0002,527,232
7Jul 20, 2022 15:0997,055506,600,226473,570,0001,998,0002,265,088
8Jul 20, 2022 15:0997,064503,353,033473,614,0001,998,0002,347,008
9Jul 20, 2022 15:0997,067503,526,960474,630,000999,0002,342,912
10Jul 20, 2022 15:0997,071500,518,179473,651,0001,998,0002,265,088
11Jul 20, 2022 15:0997,080500,308,151473,692,0001,998,0002,265,088
12Jul 20, 2022 15:0997,697552,190,042478,713,03602,240,512