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 listAug 9, 2022 20:18deniskolsanovdeniskolsanovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2022 20:1800000Error: expected "560378980161 ", got "3056155115 3862923045 820258428 1423054007 4234659426 213035665 2083146995 3909043324 3678431710 118518533 4188574518 1100606953 4091528361 2694445705 3493177468 405338418 4118053141 3467767682 365122580 1397125868...