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 listOct 19, 2026 04:08zayd-ansari-codezayd-ansari-codeScore: 2,143,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 04:102,090,15327,047,046,7935,897,101,0004,344,650,0002,113,536
2Oct 19, 2026 04:102,143,53025,857,500,2345,947,588,0004,555,712,0002,129,920
3Oct 19, 2026 04:102,151,75625,965,364,2445,969,854,0004,573,753,0002,129,920