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 3, 2021 22:31Stanislav-PovolotskyStanislav-PovolotskyScore: 429,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2021 22:31378,7461,916,979,6691,855,855,53902,277,376
2May 3, 2021 22:31379,1751,910,982,7331,857,955,96002,269,184
3May 3, 2021 22:31379,3291,941,404,7951,858,712,73802,273,280
4May 3, 2021 22:31429,2372,173,881,1232,103,260,50702,277,376
5May 3, 2021 22:31429,2562,164,555,8392,103,354,65502,269,184
6May 3, 2021 22:31429,2742,166,978,3502,103,443,76302,273,280