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 5, 2026 22:19Victor MerckléVictor MerckléScore: 58,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 22:1958,439295,490,071284,328,0002,026,0002,113,536
2Jun 5, 2026 22:1958,445295,660,168284,365,0002,020,0002,113,536
3Jun 5, 2026 22:1958,445295,558,819284,227,0002,156,0002,113,536
4Jun 5, 2026 22:1958,490295,712,356284,390,0002,211,0002,113,536
5Jun 5, 2026 22:1958,495295,783,784284,468,0002,160,0002,113,536
6Jun 5, 2026 22:1958,496295,754,842284,396,0002,238,0002,113,536
7Jun 5, 2026 22:1958,517295,939,493284,549,0002,185,0002,113,536
8Jun 5, 2026 22:1958,555296,075,818284,703,0002,217,0002,113,536
9Jun 5, 2026 22:1958,595296,388,613285,038,0002,081,0002,113,536