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:11Victor MerckléVictor MerckléScore: 31,713Success
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 07:1131,670163,518,500154,176,0001,011,0002,117,632stderr
2Aug 25, 2026 07:1131,679163,638,553154,218,0001,010,0002,117,632stderr
3Aug 25, 2026 07:1131,680163,649,804154,221,0001,011,0002,117,632stderr
4Aug 25, 2026 07:1131,700163,702,521154,323,0001,009,0002,117,632stderr
5Aug 25, 2026 07:1131,713163,767,890154,384,0001,010,0002,117,632stderr
6Aug 25, 2026 07:1131,722163,844,502154,428,0001,010,0002,117,632stderr
7Aug 25, 2026 07:1131,724165,041,664154,441,0001,011,0002,117,632stderr
8Aug 25, 2026 07:1131,733163,868,520154,481,0001,011,0002,117,632stderr
9Aug 25, 2026 07:1131,744163,921,450154,538,0001,012,0002,117,632stderr