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 listAug 4, 2026 00:09Josu San MartinJosu San MartinScore: 27,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 00:1027,917145,271,951135,532,0001,263,0002,113,536
2Aug 4, 2026 00:1027,923145,003,965135,649,0001,176,0002,113,536
3Aug 4, 2026 00:1027,935145,298,094135,613,0001,273,0002,113,536
4Aug 4, 2026 00:1027,954145,451,229135,779,0001,200,0002,113,536
5Aug 4, 2026 00:1027,967145,525,966135,862,0001,181,0002,113,536
6Aug 4, 2026 00:1027,979145,557,346135,920,0001,180,0002,113,536
7Aug 4, 2026 00:1027,990145,599,691136,089,0001,063,0002,113,536
8Aug 4, 2026 00:1028,005145,691,349135,971,0001,258,0002,113,536
9Aug 4, 2026 00:1028,153146,080,642136,749,0001,204,0002,113,536