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 4, 2026 10:17Josu San MartinJosu San MartinScore: 26,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 10:1826,629139,590,299129,221,0001,262,0002,113,536
2Aug 4, 2026 10:1826,640139,030,958129,287,0001,252,0002,113,536
3Aug 4, 2026 10:1826,662139,098,634129,388,0001,260,0002,113,536
4Aug 4, 2026 10:1826,668139,051,422129,424,0001,252,0002,113,536
5Aug 4, 2026 10:1826,686139,917,463129,757,0001,009,0002,113,536
6Aug 4, 2026 10:1826,711139,276,355129,885,0001,003,0002,113,536
7Aug 4, 2026 10:1827,073140,984,760131,648,0001,013,0002,113,536
8Aug 4, 2026 10:1827,074141,056,992131,661,0001,006,0002,113,536
9Aug 4, 2026 10:1831,782164,771,210154,475,0001,260,0002,113,536