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:05Victor MerckléVictor MerckléScore: 29,518Success
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:0629,432152,575,709143,208,0001,012,0002,117,632stderr
2Aug 24, 2026 16:0629,434152,576,133143,220,0001,010,0002,117,632stderr
3Aug 24, 2026 16:0629,461152,544,081143,354,0001,009,0002,117,632stderr
4Aug 24, 2026 16:0629,485152,893,168143,467,0001,012,0002,117,632stderr
5Aug 24, 2026 16:0629,518153,018,284142,605,0002,036,0002,117,632stderr
6Aug 24, 2026 16:0629,714154,028,553144,592,0001,009,0002,117,632stderr
7Aug 24, 2026 16:0629,803154,218,719145,028,0001,009,0002,117,632stderr
8Aug 24, 2026 16:0629,834154,577,888145,178,0001,009,0002,117,632stderr
9Aug 24, 2026 16:0629,972155,221,786145,856,0001,010,0002,117,632stderr