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 16:00Victor MerckléVictor MerckléScore: 38,094Success
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 16:0137,906194,070,718184,737,0001,006,0002,117,632stderr
2Aug 24, 2026 16:0137,954194,463,685184,970,0001,006,0002,117,632stderr
3Aug 24, 2026 16:0137,972194,553,534185,057,0001,007,0002,117,632stderr
4Aug 24, 2026 16:0138,033194,786,674185,358,0001,006,0002,117,632stderr
5Aug 24, 2026 16:0138,094195,056,872185,654,0001,007,0002,117,632stderr
6Aug 24, 2026 16:0138,222195,674,021186,285,0001,005,0002,117,632stderr
7Aug 24, 2026 16:0138,369196,384,214187,006,0001,006,0002,117,632stderr
8Aug 24, 2026 16:0139,170200,289,033190,930,0001,006,0002,117,632stderr
9Aug 24, 2026 16:0142,548218,010,309207,482,0001,007,0002,117,632stderr