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:48Victor MerckléVictor MerckléScore: 57,012Success
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:4856,903287,921,580276,649,0002,179,0002,113,536
2Jun 6, 2026 19:4856,931288,198,703276,782,0002,184,0002,117,632
3Jun 6, 2026 19:4856,969288,242,096277,129,0002,022,0002,113,536
4Jun 6, 2026 19:4856,999288,373,303277,290,0002,008,0002,113,536
5Jun 6, 2026 19:4857,012288,431,492277,146,0002,217,0002,113,536
6Jun 6, 2026 19:4857,144289,096,521277,774,0002,232,0002,113,536
7Jun 6, 2026 19:4857,156289,228,729278,049,0002,017,0002,113,536
8Jun 6, 2026 19:4857,380290,320,429279,158,0002,008,0002,113,536
9Jun 6, 2026 19:4857,457292,917,079279,308,0002,232,0002,113,536