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 07:59Victor MerckléVictor MerckléScore: 28,591Success
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 08:0028,553148,424,958138,905,0001,008,0002,117,632stderr
2Aug 25, 2026 08:0028,583148,419,349139,052,0001,008,0002,117,632stderr
3Aug 25, 2026 08:0028,587148,441,703139,070,0001,008,0002,117,632stderr
4Aug 25, 2026 08:0028,589148,497,947139,079,0001,009,0002,117,632stderr
5Aug 25, 2026 08:0028,591148,461,447139,090,0001,009,0002,117,632stderr
6Aug 25, 2026 08:0028,606148,565,668139,165,0001,008,0002,117,632stderr
7Aug 25, 2026 08:0028,629148,690,144139,276,0001,008,0002,117,632stderr
8Aug 25, 2026 08:0028,658148,799,881138,401,0002,027,0002,117,632stderr
9Aug 25, 2026 08:0028,695149,114,178139,598,0001,010,0002,117,632stderr