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 1, 2024 07:01Andrey TsvetkovAndrey TsvetkovScore: 1,435,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2024 07:011,434,9837,116,849,3457,031,417,29802,203,648
2Jun 1, 2024 07:011,435,0617,099,411,9307,031,799,69402,199,552
3Jun 1, 2024 07:011,435,7687,101,803,1187,035,265,23502,187,264