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 18:42Victor MerckléVictor MerckléScore: 28,787Success
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 18:4328,680149,079,924138,519,0002,017,0002,117,632stderr
2Aug 24, 2026 18:4328,689148,981,371138,549,0002,030,0002,117,632stderr
3Aug 24, 2026 18:4328,742149,218,617138,829,0002,011,0002,117,632stderr
4Aug 24, 2026 18:4328,773149,313,395138,981,0002,010,0002,117,632stderr
5Aug 24, 2026 18:4328,787149,210,785139,043,0002,017,0002,117,632stderr
6Aug 24, 2026 18:4328,798149,567,423139,083,0002,028,0002,117,632stderr
7Aug 24, 2026 18:4328,805149,707,994139,104,0002,044,0002,117,632stderr
8Aug 24, 2026 18:4328,866149,812,858139,418,0002,030,0002,117,632stderr
9Aug 24, 2026 18:4330,817159,403,896149,995,0001,009,0002,117,632stderr