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 19, 2026 21:06Victor MerckléVictor MerckléScore: 53,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 21:0752,933266,888,890257,348,0002,024,0002,113,536
2Jun 19, 2026 21:0752,974267,176,354257,556,0002,020,0002,113,536
3Jun 19, 2026 21:0753,007267,345,944257,689,0002,049,0002,113,536
4Jun 19, 2026 21:0753,025267,315,299257,787,0002,040,0002,113,536
5Jun 19, 2026 21:0753,026267,452,935257,817,0002,013,0002,113,536
6Jun 19, 2026 21:0753,034267,490,140257,852,0002,018,0002,113,536
7Jun 19, 2026 21:0753,045267,567,567257,803,0002,122,0002,113,536
8Jun 19, 2026 21:0753,784271,642,258261,400,0002,142,0002,113,536
9Jun 19, 2026 21:0753,858271,530,763261,882,0002,023,0002,113,536