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 19:12Victor MerckléVictor MerckléScore: 29,580Success
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 19:1329,457152,792,778143,336,0001,008,0002,117,632stderr
2Aug 24, 2026 19:1329,489152,855,459142,481,0002,017,0002,117,632stderr
3Aug 24, 2026 19:1329,521153,070,424143,648,0001,008,0002,117,632stderr
4Aug 24, 2026 19:1329,544153,141,177142,751,0002,018,0002,117,632stderr
5Aug 24, 2026 19:1329,580153,433,865142,938,0002,006,0002,117,632stderr
6Aug 24, 2026 19:1329,607153,424,486143,039,0002,040,0002,117,632stderr
7Aug 24, 2026 19:1329,724154,049,483144,640,0001,009,0002,117,632stderr
8Aug 24, 2026 19:1329,792154,336,234144,972,0001,009,0002,117,632stderr
9Aug 24, 2026 19:1329,822154,611,886144,093,0002,039,0002,117,632stderr