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 2, 2026 14:26Josu San MartinJosu San MartinScore: 30,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:2730,559160,566,514148,613,0001,127,0002,113,536
2Aug 2, 2026 14:2730,564160,563,869148,642,0001,123,0002,113,536
3Aug 2, 2026 14:2730,576160,509,857148,693,0001,130,0002,113,536
4Aug 2, 2026 14:2730,576159,889,824148,677,0001,146,0002,113,536
5Aug 2, 2026 14:2730,587160,002,376148,752,0001,129,0002,113,536
6Aug 2, 2026 14:2730,587160,027,885148,739,0001,142,0002,113,536
7Aug 2, 2026 14:2730,598161,974,012148,811,0001,122,0002,113,536
8Aug 2, 2026 14:2730,627160,073,602148,947,0001,126,0002,113,536
9Aug 2, 2026 14:2730,755161,514,771149,569,0001,133,0002,113,536