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 3, 2026 20:41anboto1anboto1Score: 57,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:4357,526290,316,950280,737,0001,141,0002,113,536
2Aug 3, 2026 20:4357,550290,489,650280,808,0001,187,0002,113,536
3Aug 3, 2026 20:4357,559290,718,486280,922,0001,120,0002,113,536
4Aug 3, 2026 20:4357,559291,188,597280,928,0001,113,0002,113,536
5Aug 3, 2026 20:4357,766291,436,174281,951,0001,107,0002,113,536
6Aug 3, 2026 20:4357,768292,179,375281,932,0001,133,0002,113,536
7Aug 3, 2026 20:4357,836292,428,754282,284,0001,117,0002,113,536
8Aug 3, 2026 20:4357,945292,201,619282,819,0001,112,0002,113,536
9Aug 3, 2026 20:4358,012294,708,487283,149,0001,112,0002,113,536