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 21:24Victor MerckléVictor MerckléScore: 32,655Success
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 21:2432,485167,671,511158,167,0001,011,0002,117,632stderr
2Aug 24, 2026 21:2432,577167,976,591158,620,0001,011,0002,117,632stderr
3Aug 24, 2026 21:2432,626168,258,914158,860,0001,009,0002,117,632stderr
4Aug 24, 2026 21:2432,648168,443,597158,967,0001,012,0002,117,632stderr
5Aug 24, 2026 21:2432,655168,421,867159,003,0001,010,0002,117,632stderr
6Aug 24, 2026 21:2432,673168,487,842159,087,0001,013,0002,117,632stderr
7Aug 24, 2026 21:2432,674168,466,673159,096,0001,010,0002,117,632stderr
8Aug 24, 2026 21:2432,751168,872,260159,471,0001,013,0002,117,632stderr
9Aug 24, 2026 21:2432,994170,054,987160,662,0001,010,0002,117,632stderr