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 listJul 9, 2026 22:05Victor MerckléVictor MerckléScore: 31,013Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:0630,820161,065,199150,008,0001,012,0002,117,632stderr
2Jul 9, 2026 22:0630,929159,425,128150,547,0001,009,0002,117,632stderr
3Jul 9, 2026 22:0630,949159,720,415150,645,0001,008,0002,117,632stderr
4Jul 9, 2026 22:0630,993159,966,354150,859,0001,009,0002,117,632stderr
5Jul 9, 2026 22:0631,013160,023,996150,960,0001,008,0002,117,632stderr
6Jul 9, 2026 22:0631,040159,952,131151,087,0001,010,0002,117,632stderr
7Jul 9, 2026 22:0631,057160,279,477151,174,0001,008,0002,117,632stderr
8Jul 9, 2026 22:0631,089160,252,692151,328,0001,009,0002,117,632stderr
9Jul 9, 2026 22:0631,870164,049,452155,154,0001,011,0002,117,632stderr