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:44anboto1anboto1Score: 58,294Success
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:4758,039292,890,182283,304,0001,089,0002,113,536
2Aug 3, 2026 20:4758,073293,149,978283,464,0001,096,0002,113,536
3Aug 3, 2026 20:4758,215293,685,045284,155,0001,100,0002,113,536
4Aug 3, 2026 20:4758,243293,883,409284,235,0001,159,0002,113,536
5Aug 3, 2026 20:4758,294294,827,037284,503,0001,142,0002,113,536
6Aug 3, 2026 20:4758,428294,855,163285,239,0001,059,0002,113,536
7Aug 3, 2026 20:4758,921297,207,842287,601,0001,112,0002,113,536
8Aug 3, 2026 20:4759,177298,429,205288,814,0001,155,0002,113,536
9Aug 3, 2026 20:4759,507301,449,845290,463,0001,124,0002,113,536