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 00:35Victor MerckléVictor MerckléScore: 40,805Success
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 00:3640,402214,581,781196,965,0001,005,0002,117,632stderr
2Aug 25, 2026 00:3640,551218,064,402197,697,0001,007,0002,117,632stderr
3Aug 25, 2026 00:3640,640214,501,054198,130,0001,008,0002,117,632stderr
4Aug 25, 2026 00:3640,736207,994,707198,603,0001,007,0002,117,632stderr
5Aug 25, 2026 00:3640,805208,160,064198,943,0001,005,0002,117,632stderr
6Aug 25, 2026 00:3640,922209,655,272199,511,0001,007,0002,117,632stderr
7Aug 25, 2026 00:3640,950209,027,746199,651,0001,006,0002,117,632stderr
8Aug 25, 2026 00:3640,956209,276,149199,681,0001,007,0002,117,632stderr
9Aug 25, 2026 00:3640,956209,766,650198,680,0002,005,0002,117,632stderr