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 listJul 25, 2021 16:25Mikhail ShirokovMikhail ShirokovScore: 4,394,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2021 16:254,393,20321,590,749,58921,526,695,49302,285,568
2Jul 25, 2021 16:254,394,05721,599,289,63721,530,881,59602,285,568
3Jul 25, 2021 16:254,398,37521,614,085,54121,552,037,28302,277,376