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:39Josu San MartinJosu San MartinScore: 29,836Success
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:4029,812155,110,205145,073,0001,008,0002,113,536
2Aug 3, 2026 00:4029,818155,134,331144,841,0001,268,0002,113,536
3Aug 3, 2026 00:4029,823155,296,478144,865,0001,272,0002,113,536
4Aug 3, 2026 00:4029,832155,308,843144,901,0001,276,0002,113,536
5Aug 3, 2026 00:4029,836155,275,847144,920,0001,278,0002,113,536
6Aug 3, 2026 00:4029,841155,285,130145,140,0001,082,0002,113,536
7Aug 3, 2026 00:4029,847155,296,429145,176,0001,075,0002,113,536
8Aug 3, 2026 00:4029,909155,611,342145,465,0001,090,0002,113,536
9Aug 3, 2026 00:4031,170161,830,428151,461,0001,274,0002,113,536