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 6, 2026 19:33Victor MerckléVictor MerckléScore: 56,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 19:3356,749288,493,963275,862,0002,210,0002,113,536
2Jun 6, 2026 19:3356,807287,633,330276,174,0002,183,0002,113,536
3Jun 6, 2026 19:3356,810287,491,373276,189,0002,180,0002,113,536
4Jun 6, 2026 19:3356,821287,555,893276,261,0002,165,0002,113,536
5Jun 6, 2026 19:3356,824287,568,805276,235,0002,206,0002,113,536
6Jun 6, 2026 19:3356,837287,704,069276,427,0002,079,0002,113,536
7Jun 6, 2026 19:3356,845287,689,605276,508,0002,035,0002,113,536
8Jun 6, 2026 19:3356,860287,847,794276,385,0002,232,0002,113,536
9Jun 6, 2026 19:3356,944288,259,885276,963,0002,065,0002,113,536