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 1, 2026 04:29anboto1anboto1Score: 325,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 04:29325,0471,603,015,2331,591,602,0001,133,0002,113,536
2Aug 1, 2026 04:29325,0801,603,111,2791,591,779,0001,116,0002,113,536
3Aug 1, 2026 04:29325,1011,603,246,3241,591,882,0001,116,0002,113,536
4Aug 1, 2026 04:29325,1411,603,477,8701,592,090,0001,104,0002,113,536
5Aug 1, 2026 04:29325,1831,604,192,4861,592,257,0001,144,0002,113,536
6Aug 1, 2026 04:29325,1901,603,719,2621,592,325,0001,107,0002,113,536
7Aug 1, 2026 04:29325,2301,605,045,2141,592,504,0001,125,0002,113,536
8Aug 1, 2026 04:29325,2461,603,954,7871,592,589,0001,118,0002,113,536
9Aug 1, 2026 04:29325,2671,604,018,5631,592,688,0001,123,0002,113,536