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 20, 2026 02:11Victor MerckléVictor MerckléScore: 50,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 02:1250,704256,475,718246,442,0002,009,0002,113,536
2Jun 20, 2026 02:1250,711256,196,036246,474,0002,011,0002,113,536
3Jun 20, 2026 02:1250,730256,192,374246,557,0002,023,0002,113,536
4Jun 20, 2026 02:1250,752256,342,446246,597,0002,089,0002,113,536
5Jun 20, 2026 02:1250,764256,401,869246,688,0002,057,0002,113,536
6Jun 20, 2026 02:1250,777256,491,092246,771,0002,041,0002,113,536
7Jun 20, 2026 02:1250,792256,491,575246,718,0002,164,0002,113,536
8Jun 20, 2026 02:1250,844256,803,833247,103,0002,035,0002,113,536
9Jun 20, 2026 02:1251,145258,225,338248,603,0002,008,0002,113,536