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 10:27Josu San MartinJosu San MartinScore: 30,437Success
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 10:2830,405157,369,748147,733,0001,254,0002,113,536
2Aug 3, 2026 10:2830,409157,457,464147,747,0001,258,0002,113,536
3Aug 3, 2026 10:2830,414158,804,219148,018,0001,011,0002,113,536
4Aug 3, 2026 10:2830,424157,496,029148,044,0001,038,0002,113,536
5Aug 3, 2026 10:2830,437158,161,007148,092,0001,051,0002,113,536
6Aug 3, 2026 10:2830,441157,600,785147,891,0001,270,0002,113,536
7Aug 3, 2026 10:2830,690158,867,030149,118,0001,265,0002,113,536
8Aug 3, 2026 10:2830,806159,426,184149,893,0001,058,0002,113,536
9Aug 3, 2026 10:2830,933160,021,471150,310,0001,265,0002,113,536