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 listJun 10, 2021 14:30Dmitry DolgopolovDmitry DolgopolovScore: 185,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2021 14:30183,492956,653,018899,110,34302,301,952
2Jun 10, 2021 14:32184,399969,453,192903,554,50402,174,976
3Jun 10, 2021 14:32184,552961,124,026904,302,61202,174,976
4Jun 10, 2021 14:30185,242976,494,596907,685,67202,174,976
5Jun 10, 2021 14:30188,571990,266,524923,999,79202,179,072
6Jun 10, 2021 14:32188,587991,667,375924,078,64002,187,264