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 12, 2024 18:21Yuriy LyfenkoYuriy LyfenkoScore: 91,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 18:2191,125475,464,879445,516,000998,0002,260,992
2Dec 12, 2024 18:2191,126473,753,078444,519,0001,997,0002,338,816
3Dec 12, 2024 18:2191,157471,288,106444,673,0001,998,0002,338,816
4Dec 12, 2024 18:2191,158473,791,980444,675,0001,998,0002,260,992
5Dec 12, 2024 18:2191,235472,204,148446,051,0001,000,0002,457,600
6Dec 12, 2024 18:2191,261474,668,107446,180,0001,000,0002,342,912
7Dec 12, 2024 18:2191,284469,507,043446,290,0001,000,0002,260,992
8Dec 12, 2024 18:2191,306473,379,409446,398,0001,000,0002,334,720
9Dec 12, 2024 18:2191,329473,243,042446,516,000998,0002,523,136