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 01:42Victor MerckléVictor MerckléScore: 51,688Success
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 01:4351,622260,539,036250,904,0002,045,0002,113,536
2Jun 18, 2026 01:4351,646260,670,281250,979,0002,089,0002,113,536
3Jun 18, 2026 01:4351,652260,568,651251,048,0002,047,0002,113,536
4Jun 18, 2026 01:4351,653260,782,705251,045,0002,055,0002,113,536
5Jun 18, 2026 01:4351,688260,765,829251,253,0002,020,0002,113,536
6Jun 18, 2026 01:4351,692261,499,493251,271,0002,023,0002,113,536
7Jun 18, 2026 01:4351,724261,121,747251,446,0002,006,0002,113,536
8Jun 18, 2026 01:4351,769261,259,346251,642,0002,028,0002,113,536
9Jun 18, 2026 01:4352,238263,605,277254,961,0001,007,0002,113,536