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 11:23Josu San MartinJosu San MartinScore: 26,122Success
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 11:2426,042139,470,216126,334,0001,273,0002,113,536
2Aug 4, 2026 11:2426,054136,508,471126,491,0001,178,0002,113,536
3Aug 4, 2026 11:2426,069136,118,591126,538,0001,203,0002,113,536
4Aug 4, 2026 11:2426,072136,239,476126,696,0001,060,0002,113,536
5Aug 4, 2026 11:2426,122136,445,427126,745,0001,255,0002,113,536
6Aug 4, 2026 11:2426,162136,698,326127,005,0001,191,0002,113,536
7Aug 4, 2026 11:2426,185138,192,037127,294,0001,013,0002,113,536
8Aug 4, 2026 11:2426,505138,360,022128,702,0001,174,0002,113,536
9Aug 4, 2026 11:2426,556138,529,789128,863,0001,263,0002,113,536