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:45Yurkov AlekseyYurkov AlekseyScore: 673,415Success
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:45643,6513,215,872,4243,153,891,52802,273,280
2May 17, 2021 23:45644,5023,220,980,4483,158,061,62002,277,376
3May 17, 2021 23:45645,2013,220,237,4433,161,484,64502,269,184
4May 17, 2021 23:45673,4153,370,198,1483,299,732,29102,269,184
5May 17, 2021 23:45673,4693,380,521,8913,299,996,63802,265,088
6May 17, 2021 23:45673,5093,369,432,5563,300,196,45802,273,280