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 23:12Victor MerckléVictor MerckléScore: 28,460Success
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 23:1328,236146,727,087136,311,0002,046,0002,117,632stderr
2Aug 24, 2026 23:1328,325147,133,078137,785,0001,010,0002,117,632stderr
3Aug 24, 2026 23:1328,359147,340,477136,924,0002,036,0002,117,632stderr
4Aug 24, 2026 23:1328,366147,319,667137,984,0001,010,0002,117,632stderr
5Aug 24, 2026 23:1328,460147,855,149138,445,0001,009,0002,117,632stderr
6Aug 24, 2026 23:1328,472147,903,334137,480,0002,036,0002,117,632stderr
7Aug 24, 2026 23:1328,576148,432,929138,000,0002,025,0002,117,632stderr
8Aug 24, 2026 23:1328,687149,019,239138,562,0002,009,0002,117,632stderr
9Aug 24, 2026 23:1328,687148,998,543138,510,0002,057,0002,117,632stderr