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 24, 2026 23:40Victor MerckléVictor MerckléScore: 28,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 23:4128,329147,148,449137,804,0001,011,0002,117,632stderr
2Aug 24, 2026 23:4128,380147,431,690138,053,0001,010,0002,117,632stderr
3Aug 24, 2026 23:4128,408147,566,316137,161,0002,042,0002,117,632stderr
4Aug 24, 2026 23:4128,413147,560,279138,217,0001,009,0002,117,632stderr
5Aug 24, 2026 23:4128,429147,666,554137,294,0002,012,0002,117,632stderr
6Aug 24, 2026 23:4128,432147,638,077137,300,0002,020,0002,117,632stderr
7Aug 24, 2026 23:4128,469147,834,502137,440,0002,062,0002,117,632stderr
8Aug 24, 2026 23:4128,649148,758,782139,372,0001,009,0002,117,632stderr
9Aug 24, 2026 23:4129,339152,207,711142,752,0001,010,0002,117,632stderr