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 07:30Victor MerckléVictor MerckléScore: 28,158Success
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 07:3128,124146,181,484136,801,0001,011,0002,117,632stderr
2Aug 25, 2026 07:3128,150146,408,242135,928,0002,010,0002,117,632stderr
3Aug 25, 2026 07:3128,153146,312,076135,932,0002,019,0002,117,632stderr
4Aug 25, 2026 07:3128,157146,373,879135,946,0002,026,0002,117,632stderr
5Aug 25, 2026 07:3128,158146,360,969135,970,0002,007,0002,117,632stderr
6Aug 25, 2026 07:3128,171147,656,078136,037,0002,005,0002,117,632stderr
7Aug 25, 2026 07:3128,190146,498,609137,120,0001,011,0002,117,632stderr
8Aug 25, 2026 07:3128,213146,633,370136,167,0002,081,0002,117,632stderr
9Aug 25, 2026 07:3128,242146,805,973136,318,0002,070,0002,117,632stderr