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 06:58anboto1anboto1Score: 267,243Success
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 06:58267,1541,320,506,5811,307,952,0001,106,0002,113,536
2Aug 3, 2026 06:58267,2071,319,359,5201,308,204,0001,113,0002,113,536
3Aug 3, 2026 06:58267,2181,319,596,7811,308,256,0001,115,0002,113,536
4Aug 3, 2026 06:58267,2281,319,512,8731,308,302,0001,119,0002,113,536
5Aug 3, 2026 06:58267,2431,319,589,5541,308,368,0001,123,0002,113,536
6Aug 3, 2026 06:58267,2651,319,813,7681,308,481,0001,121,0002,113,536
7Aug 3, 2026 06:58267,2891,319,883,0411,308,579,0001,138,0002,113,536
8Aug 3, 2026 06:58267,3291,320,042,0661,308,780,0001,133,0002,113,536
9Aug 3, 2026 06:58267,5611,321,386,6551,307,921,0003,132,0002,113,536