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 08:14Victor MerckléVictor MerckléScore: 27,442Success
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 08:1427,378147,063,749133,101,0001,054,0002,117,632stderr
2Aug 25, 2026 08:1427,400142,641,107133,236,0001,028,0002,117,632stderr
3Aug 25, 2026 08:1427,438142,860,549133,360,0001,089,0002,117,632stderr
4Aug 25, 2026 08:1427,439142,866,419133,358,0001,096,0002,117,632stderr
5Aug 25, 2026 08:1427,442142,890,414133,386,0001,083,0002,117,632stderr
6Aug 25, 2026 08:1427,453148,706,203133,385,0001,138,0002,117,632stderr
7Aug 25, 2026 08:1427,491143,073,925133,610,0001,099,0002,117,632stderr
8Aug 25, 2026 08:1427,500143,152,148133,655,0001,097,0002,117,632stderr
9Aug 25, 2026 08:1427,501143,902,928133,658,0001,098,0002,117,632stderr