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 22, 2026 06:13Victor MerckléVictor MerckléScore: 52,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 06:1452,726266,077,705256,351,0002,008,0002,113,536
2Jun 22, 2026 06:1452,727266,086,469256,316,0002,051,0002,113,536
3Jun 22, 2026 06:1452,755266,197,928256,355,0002,149,0002,113,536
4Jun 22, 2026 06:1452,787266,304,470256,528,0002,130,0002,113,536
5Jun 22, 2026 06:1452,862266,712,102257,013,0002,014,0002,113,536
6Jun 22, 2026 06:1452,937267,426,897257,132,0002,263,0002,113,536
7Jun 22, 2026 06:1452,962267,207,771257,416,0002,100,0002,113,536
8Jun 22, 2026 06:1453,033267,602,762257,655,0002,210,0002,113,536
9Jun 22, 2026 06:1453,426269,491,960259,641,0002,149,0002,113,536