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 17, 2026 13:52Victor MerckléVictor MerckléScore: 54,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 13:5354,005273,621,804262,553,0002,073,0002,113,536
2Jun 17, 2026 13:5354,015273,793,010262,562,0002,116,0002,113,536
3Jun 17, 2026 13:5354,026274,939,657262,644,0002,085,0002,113,536
4Jun 17, 2026 13:5354,041273,924,212262,745,0002,059,0002,113,536
5Jun 17, 2026 13:5354,091274,183,234262,959,0002,087,0002,113,536
6Jun 17, 2026 13:5354,097274,124,064263,028,0002,050,0002,113,536
7Jun 17, 2026 13:5354,121274,275,416263,145,0002,051,0002,113,536
8Jun 17, 2026 13:5354,134274,292,626263,212,0002,047,0002,113,536
9Jun 17, 2026 13:5354,575276,503,479265,355,0002,067,0002,113,536