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 2, 2026 12:27Josu San MartinJosu San MartinScore: 33,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 12:2833,849176,587,674164,748,0001,114,0002,113,536
2Aug 2, 2026 12:2833,863175,942,774164,845,0001,087,0002,113,536
3Aug 2, 2026 12:2833,871176,022,008164,857,0001,111,0002,113,536
4Aug 2, 2026 12:2833,888177,343,635164,927,0001,127,0002,113,536
5Aug 2, 2026 12:2833,893176,847,911164,946,0001,133,0002,113,536
6Aug 2, 2026 12:2833,893176,822,109164,951,0001,129,0002,113,536
7Aug 2, 2026 12:2833,899176,919,952164,997,0001,111,0002,113,536
8Aug 2, 2026 12:2834,033176,850,716165,659,0001,106,0002,113,536
9Aug 2, 2026 12:2836,140187,905,100175,945,0001,141,0002,113,536