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 00:42Josu San MartinJosu San MartinScore: 30,004Success
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 00:4229,964155,895,970145,547,0001,277,0002,113,536
2Aug 3, 2026 00:4229,984156,006,927145,909,0001,015,0002,113,536
3Aug 3, 2026 00:4229,989156,120,112145,945,0001,005,0002,113,536
4Aug 3, 2026 00:4229,993155,453,387145,709,0001,258,0002,113,536
5Aug 3, 2026 00:4230,004155,486,708145,899,0001,121,0002,113,536
6Aug 3, 2026 00:4230,013163,274,053146,025,0001,042,0002,113,536
7Aug 3, 2026 00:4230,024156,062,644145,848,0001,271,0002,113,536
8Aug 3, 2026 00:4230,057156,321,070146,265,0001,016,0002,113,536
9Aug 3, 2026 00:4230,175156,025,730146,838,0001,020,0002,113,536