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 24, 2021 07:37alex3dalex3dScore: 666,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 07:37566,8112,839,812,8452,777,373,31702,269,184
2May 24, 2021 07:37566,8382,832,282,2752,777,505,28602,273,280
3May 24, 2021 07:37567,1362,854,057,7612,778,967,94802,265,088
4May 24, 2021 07:37666,4703,333,440,8143,265,702,35402,273,280
5May 24, 2021 07:37666,5513,330,193,9473,266,099,75502,273,280
6May 24, 2021 07:37667,5923,340,155,9763,271,199,09602,269,184