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 listOct 20, 2025 02:44Marco BarboneMarco BarboneScore: 770,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2025 02:44770,3033,802,005,7723,773,487,000999,0002,273,280
2Oct 20, 2025 02:44770,4723,803,610,5083,774,312,000999,0002,273,280
3Oct 20, 2025 02:44770,4943,803,009,1553,774,424,000999,0002,433,024
4Oct 20, 2025 02:44770,4963,800,085,1443,773,433,0001,998,0002,273,280
5Oct 20, 2025 02:44770,5003,803,956,3793,774,453,000999,0002,277,376
6Oct 20, 2025 02:44770,5103,797,381,1103,773,501,0001,998,0002,273,280
7Oct 20, 2025 02:44770,5853,805,772,6303,775,868,00002,277,376
8Oct 20, 2025 02:44770,7263,802,141,9823,775,560,000999,0002,273,280
9Oct 20, 2025 02:44770,7563,801,488,8583,775,705,000999,0002,535,424