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 listMay 17, 2021 23:46Yurkov AlekseyYurkov AlekseyScore: 673,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 23:46643,5273,220,881,5383,153,283,85002,273,280
2May 17, 2021 23:46644,3533,218,697,9123,157,331,86802,260,992
3May 17, 2021 23:46644,4473,211,706,4143,157,788,99702,277,376
4May 17, 2021 23:46673,3283,372,686,9733,299,306,51802,277,376
5May 17, 2021 23:46673,5323,360,010,4123,300,308,55002,269,184
6May 17, 2021 23:46673,9373,364,250,7073,302,289,82702,265,088