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 18, 2026 19:33Victor MerckléVictor MerckléScore: 51,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 19:3351,942261,945,052252,505,0002,012,0002,113,536
2Jun 18, 2026 19:3351,948262,138,252252,543,0002,006,0002,113,536
3Jun 18, 2026 19:3351,954262,185,718252,523,0002,052,0002,113,536
4Jun 18, 2026 19:3351,963262,245,093252,575,0002,048,0002,113,536
5Jun 18, 2026 19:3351,971262,329,304252,614,0002,046,0002,113,536
6Jun 18, 2026 19:3352,023262,377,785252,868,0002,048,0002,113,536
7Jun 18, 2026 19:3352,056262,772,011252,948,0002,130,0002,113,536
8Jun 18, 2026 19:3352,069262,707,082253,081,0002,059,0002,113,536
9Jun 18, 2026 19:3352,351264,192,435254,421,0002,100,0002,113,536