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 01:14Victor MerckléVictor MerckléScore: 28,078Success
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 01:1427,928145,406,107135,838,0001,010,0002,117,632stderr
2Aug 25, 2026 01:1427,989145,538,721136,138,0001,010,0002,117,632stderr
3Aug 25, 2026 01:1428,059146,492,430136,481,0001,010,0002,117,632stderr
4Aug 25, 2026 01:1428,064145,950,312135,480,0002,038,0002,117,632stderr
5Aug 25, 2026 01:1428,078146,018,706135,543,0002,044,0002,117,632stderr
6Aug 25, 2026 01:1428,117146,164,226136,766,0001,010,0002,117,632stderr
7Aug 25, 2026 01:1428,219146,647,029136,271,0002,005,0002,117,632stderr
8Aug 25, 2026 01:1428,261146,870,465137,471,0001,010,0002,117,632stderr
9Aug 25, 2026 01:1428,336147,262,922137,839,0001,011,0002,117,632stderr