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 6, 2026 19:58Victor MerckléVictor MerckléScore: 56,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 19:5856,178284,384,561273,038,0002,235,0002,113,536
2Jun 6, 2026 19:5856,201284,470,354273,165,0002,222,0002,113,536
3Jun 6, 2026 19:5856,219286,579,402273,465,0002,012,0002,113,536
4Jun 6, 2026 19:5856,226284,602,300273,493,0002,018,0002,113,536
5Jun 6, 2026 19:5856,231284,679,545273,320,0002,214,0002,113,536
6Jun 6, 2026 19:5856,233284,725,087273,368,0002,174,0002,113,536
7Jun 6, 2026 19:5856,253284,860,635273,566,0002,077,0002,113,536
8Jun 6, 2026 19:5856,258284,780,083273,443,0002,222,0002,113,536
9Jun 6, 2026 19:5856,677286,893,882275,533,0002,187,0002,113,536