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 25, 2026 15:07Victor MerckléVictor MerckléScore: 51,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:0750,965257,321,472247,673,0002,059,0002,113,536
2Jun 25, 2026 15:0750,966257,835,594247,641,0002,096,0002,113,536
3Jun 25, 2026 15:0750,970257,418,196247,739,0002,018,0002,113,536
4Jun 25, 2026 15:0750,974257,793,655247,753,0002,022,0002,113,536
5Jun 25, 2026 15:0751,031258,083,059247,998,0002,055,0002,113,536
6Jun 25, 2026 15:0751,033257,776,986248,003,0002,059,0002,113,536
7Jun 25, 2026 15:0751,119258,494,543248,473,0002,012,0002,113,536
8Jun 25, 2026 15:0751,166258,456,917248,692,0002,024,0002,113,536
9Jun 25, 2026 15:0751,415259,708,179249,832,0002,103,0002,113,536