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 02:39Victor MerckléVictor MerckléScore: 31,477Success
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 02:4031,362162,786,128152,667,0001,008,0002,117,632stderr
2Aug 25, 2026 02:4031,407162,371,482152,886,0001,009,0002,117,632stderr
3Aug 25, 2026 02:4031,467162,710,951153,181,0001,008,0002,117,632stderr
4Aug 25, 2026 02:4031,472162,672,763153,208,0001,007,0002,117,632stderr
5Aug 25, 2026 02:4031,477162,603,722153,232,0001,008,0002,117,632stderr
6Aug 25, 2026 02:4031,490162,719,403153,296,0001,007,0002,117,632stderr
7Aug 25, 2026 02:4031,543163,035,613153,553,0001,009,0002,117,632stderr
8Aug 25, 2026 02:4031,559163,074,029153,634,0001,008,0002,117,632stderr
9Aug 25, 2026 02:4031,712163,762,874154,383,0001,010,0002,117,632stderr