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 listJul 4, 2026 06:44Victor MerckléVictor MerckléScore: 47,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 06:4447,207239,310,865229,305,0002,012,0002,117,632stderr
2Jul 4, 2026 06:4447,277239,725,655229,569,0002,092,0002,117,632stderr
3Jul 4, 2026 06:4447,280239,718,047229,606,0002,070,0002,117,632stderr
4Jul 4, 2026 06:4447,281239,672,053229,557,0002,120,0002,117,632stderr
5Jul 4, 2026 06:4447,306239,779,601229,733,0002,067,0002,117,632stderr
6Jul 4, 2026 06:4447,458240,527,395230,483,0002,064,0002,117,632stderr
7Jul 4, 2026 06:4447,485240,617,378230,635,0002,042,0002,117,632stderr
8Jul 4, 2026 06:4447,658241,304,898231,335,0002,194,0002,117,632stderr
9Jul 4, 2026 06:4448,026243,450,620233,247,0002,083,0002,117,632stderr