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 07:52Josu San MartinJosu San MartinScore: 37,956Success
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 07:5237,552192,627,634182,806,0001,199,0002,113,536
2Aug 3, 2026 07:5237,632192,795,566183,219,0001,181,0002,113,536
3Aug 3, 2026 07:5237,679193,078,864183,629,0001,001,0002,113,536
4Aug 3, 2026 07:5237,920194,327,220184,769,0001,041,0002,113,536
5Aug 3, 2026 07:5237,956194,367,471184,809,0001,179,0002,113,536
6Aug 3, 2026 07:5238,070195,040,096185,353,0001,190,0002,113,536
7Aug 3, 2026 07:5238,087194,852,285185,606,0001,023,0002,113,536
8Aug 3, 2026 07:5238,188196,221,665185,943,0001,183,0002,113,536
9Aug 3, 2026 07:5239,634202,734,204193,166,0001,044,0002,113,536