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 25, 2026 05:33Victor MerckléVictor MerckléScore: 28,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 05:3327,930145,254,603135,848,0001,011,0002,117,632stderr
2Aug 25, 2026 05:3327,943145,416,841134,901,0002,023,0002,117,632stderr
3Aug 25, 2026 05:3327,944145,311,242135,920,0001,010,0002,117,632stderr
4Aug 25, 2026 05:3328,002146,389,884135,166,0002,048,0002,117,632stderr
5Aug 25, 2026 05:3328,024147,757,940136,311,0001,011,0002,117,632stderr
6Aug 25, 2026 05:3328,115146,155,226136,754,0001,010,0002,117,632stderr
7Aug 25, 2026 05:3328,128146,209,747135,806,0002,024,0002,117,632stderr
8Aug 25, 2026 05:3328,186146,508,044136,095,0002,019,0002,117,632stderr
9Aug 25, 2026 05:3328,330147,194,500136,783,0002,037,0002,117,632stderr