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 3, 2026 09:44Josu San MartinJosu San MartinScore: 38,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 09:4538,055196,270,103185,461,0001,012,0002,113,536
2Aug 3, 2026 09:4538,103195,096,985185,522,0001,184,0002,113,536
3Aug 3, 2026 09:4538,135195,296,953185,678,0001,187,0002,113,536
4Aug 3, 2026 09:4538,196195,610,928186,154,0001,010,0002,113,536
5Aug 3, 2026 09:4538,250195,866,562186,225,0001,200,0002,113,536
6Aug 3, 2026 09:4538,318196,148,648186,760,0001,002,0002,113,536
7Aug 3, 2026 09:4538,343196,353,021186,810,0001,071,0002,113,536
8Aug 3, 2026 09:4538,421198,013,048187,185,0001,079,0002,113,536
9Aug 3, 2026 09:4540,300206,564,096196,270,0001,204,0002,113,536