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 listSep 4, 2026 00:22Victor MerckléVictor MerckléScore: 28,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 00:2328,662148,873,347139,417,0001,029,0002,117,632stderr
2Sep 4, 2026 00:2328,685149,022,242139,455,0001,104,0002,117,632stderr
3Sep 4, 2026 00:2328,689149,027,035139,482,0001,098,0002,117,632stderr
4Sep 4, 2026 00:2328,690150,302,891139,487,0001,097,0002,117,632stderr
5Sep 4, 2026 00:2328,691149,069,138139,482,0001,104,0002,117,632stderr
6Sep 4, 2026 00:2328,692149,048,779139,495,0001,099,0002,117,632stderr
7Sep 4, 2026 00:2328,697149,307,386139,465,0001,153,0002,117,632stderr
8Sep 4, 2026 00:2328,705149,175,543139,561,0001,094,0002,117,632stderr
9Sep 4, 2026 00:2328,725149,301,449139,524,0001,232,0002,117,632stderr