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:52Yurkov AlekseyYurkov AlekseyScore: 653,079Success
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:52633,4343,173,476,6903,103,824,93802,281,472
2May 17, 2021 23:52633,4763,184,430,7403,104,030,33802,273,280
3May 17, 2021 23:52633,4923,184,580,2713,104,110,23602,273,280
4May 17, 2021 23:52653,0793,271,063,0373,200,084,99802,273,280
5May 17, 2021 23:52653,1443,269,361,8033,200,407,95802,273,280
6May 17, 2021 23:52653,2233,257,808,1063,200,791,58402,273,280