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:54Victor MerckléVictor MerckléScore: 28,968Success
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:5428,842149,667,343139,280,0002,048,0002,117,632stderr
2Aug 24, 2026 17:5428,849149,788,449139,350,0002,013,0002,117,632stderr
3Aug 24, 2026 17:5428,879149,927,330139,503,0002,007,0002,117,632stderr
4Aug 24, 2026 17:5428,937150,225,826140,785,0001,010,0002,117,632stderr
5Aug 24, 2026 17:5428,968150,378,635139,922,0002,026,0002,117,632stderr
6Aug 24, 2026 17:5429,028150,613,055140,194,0002,046,0002,117,632stderr
7Aug 24, 2026 17:5429,170151,363,684140,915,0002,020,0002,117,632stderr
8Aug 24, 2026 17:5429,235152,026,362142,243,0001,013,0002,117,632stderr
9Aug 24, 2026 17:5429,350152,082,418141,789,0002,030,0002,117,632stderr