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 21:11anboto1anboto1Score: 57,712Success
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 21:1257,535290,422,189280,825,0001,101,0002,113,536
2Aug 3, 2026 21:1257,572292,577,653281,014,0001,092,0002,113,536
3Aug 3, 2026 21:1257,616291,328,234281,184,0001,136,0002,113,536
4Aug 3, 2026 21:1257,686291,160,229281,558,0001,108,0002,113,536
5Aug 3, 2026 21:1257,712291,916,491281,648,0001,141,0002,113,536
6Aug 3, 2026 21:1258,161293,924,804283,987,0001,006,0002,113,536
7Aug 3, 2026 21:1258,648295,811,882286,241,0001,137,0002,113,536
8Aug 3, 2026 21:1258,650296,504,330286,288,0001,097,0002,113,536
9Aug 3, 2026 21:1259,108298,200,664288,539,0001,094,0002,113,536