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 21:31anboto1anboto1Score: 57,592Success
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 21:3157,540290,325,725280,829,0001,120,0002,113,536
2Aug 3, 2026 21:3157,540290,398,037280,835,0001,113,0002,113,536
3Aug 3, 2026 21:3157,543290,517,794280,841,0001,122,0002,113,536
4Aug 3, 2026 21:3157,547290,491,304280,871,0001,112,0002,113,536
5Aug 3, 2026 21:3157,592290,706,056281,162,0001,043,0002,113,536
6Aug 3, 2026 21:3157,681291,715,594281,389,0001,248,0002,113,536
7Aug 3, 2026 21:3157,683291,700,050281,539,0001,112,0002,113,536
8Aug 3, 2026 21:3157,822292,403,506282,198,0001,131,0002,113,536
9Aug 3, 2026 21:3157,930292,892,108282,744,0001,113,0002,113,536