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 28, 2026 10:36Victor MerckléVictor MerckléScore: 49,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 10:3649,347249,751,368239,768,0002,036,0002,117,632stderr
2Jun 28, 2026 10:3649,386249,898,054239,962,0002,032,0002,117,632stderr
3Jun 28, 2026 10:3649,404250,030,676239,993,0002,087,0002,117,632stderr
4Jun 28, 2026 10:3649,417250,121,320240,122,0002,024,0002,117,632stderr
5Jun 28, 2026 10:3649,459250,241,583240,303,0002,048,0002,117,632stderr
6Jun 28, 2026 10:3649,470251,595,489240,374,0002,033,0002,117,632stderr
7Jun 28, 2026 10:3649,496250,409,001240,467,0002,067,0002,117,632stderr
8Jun 28, 2026 10:3649,605250,982,541241,048,0002,020,0002,117,632stderr
9Jun 28, 2026 10:3649,987252,874,150242,931,0002,008,0002,117,632stderr