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 8, 2024 17:06Nick RolfeNick RolfeScore: 633,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 17:06633,8203,133,194,4053,102,721,0002,997,0002,523,136
2Dec 8, 2024 17:06633,8733,135,759,7423,102,982,0002,998,0002,281,472
3Dec 8, 2024 17:06633,9283,128,574,8493,104,247,0001,998,0002,289,664
4Dec 8, 2024 17:06633,9543,130,969,5383,103,377,0002,998,0002,289,664
5Dec 8, 2024 17:06633,9743,132,916,3033,103,475,0002,998,0002,289,664
6Dec 8, 2024 17:06633,9813,133,761,2183,103,510,0002,998,0002,281,472
7Dec 8, 2024 17:06634,0133,131,657,9803,103,667,0002,998,0002,289,664
8Dec 8, 2024 17:06634,0763,131,991,7283,104,974,0001,999,0002,281,472
9Dec 8, 2024 17:06635,3133,145,698,7503,112,034,000999,0002,273,280