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 17:32Victor MerckléVictor MerckléScore: 29,049Success
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 17:3328,793149,441,963140,080,0001,009,0002,117,632stderr
2Aug 24, 2026 17:3328,821149,654,300139,195,0002,031,0002,117,632stderr
3Aug 24, 2026 17:3328,904150,622,448139,602,0002,029,0002,117,632stderr
4Aug 24, 2026 17:3328,990150,482,455140,037,0002,015,0002,117,632stderr
5Aug 24, 2026 17:3329,049151,395,808140,331,0002,012,0002,117,632stderr
6Aug 24, 2026 17:3329,078150,951,904141,474,0001,009,0002,117,632stderr
7Aug 24, 2026 17:3329,202151,532,042141,081,0002,010,0002,117,632stderr
8Aug 24, 2026 17:3329,238151,620,580142,259,0001,010,0002,117,632stderr
9Aug 24, 2026 17:3329,542153,105,097142,720,0002,039,0002,117,632stderr