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:20anboto1anboto1Score: 57,959Success
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:2157,797292,317,811282,102,0001,105,0002,113,536
2Aug 3, 2026 20:2157,802292,459,001282,139,0001,094,0002,113,536
3Aug 3, 2026 20:2157,821292,440,773282,246,0001,079,0002,113,536
4Aug 3, 2026 20:2157,944292,492,025282,778,0001,151,0002,113,536
5Aug 3, 2026 20:2157,959293,101,597282,787,0001,216,0002,113,536
6Aug 3, 2026 20:2158,062293,079,250283,409,0001,097,0002,113,536
7Aug 3, 2026 20:2158,283294,730,779284,421,0001,166,0002,113,536
8Aug 3, 2026 20:2158,937297,238,424287,696,0001,100,0002,113,536
9Aug 3, 2026 20:2159,405300,679,480289,945,0001,142,0002,113,536