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 5, 2024 13:27Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2024 13:0900000Error: expected "560378777724 ", got "560378777292 "stderr
2Jul 5, 2024 13:1200000Error: expected "560376972020 ", got "560376971588 "stderr
3Jul 5, 2024 13:29179,364935,411,703878,881,78302,220,032
4Jul 5, 2024 13:27179,664944,381,405880,352,85102,220,032
5Jul 5, 2024 13:29180,146933,326,763882,713,06602,224,128
6Jul 5, 2024 13:27180,536946,177,896884,624,48402,224,128
7Jul 5, 2024 13:29180,601954,715,057884,946,57002,220,032
8Jul 5, 2024 13:27181,628992,130,477889,978,04402,224,128