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:32anboto1anboto1Score: 57,673Success
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:3357,577290,690,021281,017,0001,114,0002,113,536
2Aug 3, 2026 20:3357,579291,314,041281,018,0001,121,0002,113,536
3Aug 3, 2026 20:3357,613290,821,677281,269,0001,037,0002,113,536
4Aug 3, 2026 20:3357,646290,904,419281,352,0001,117,0002,113,536
5Aug 3, 2026 20:3357,673291,072,175281,557,0001,044,0002,113,536
6Aug 3, 2026 20:3357,720291,347,375281,690,0001,141,0002,113,536
7Aug 3, 2026 20:3357,747291,444,083281,797,0001,165,0002,113,536
8Aug 3, 2026 20:3358,527294,975,069285,599,0001,186,0002,113,536
9Aug 3, 2026 20:3359,225298,707,406289,017,0001,187,0002,113,536