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:17anboto1anboto1Score: 58,034Success
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:1757,903292,413,685282,602,0001,125,0002,113,536
2Aug 3, 2026 20:1757,907292,190,159282,660,0001,086,0002,113,536
3Aug 3, 2026 20:1757,960292,500,286282,914,0001,094,0002,113,536
4Aug 3, 2026 20:1757,960292,498,346282,926,0001,081,0002,113,536
5Aug 3, 2026 20:1758,034292,853,532283,256,0001,112,0002,113,536
6Aug 3, 2026 20:1758,042293,321,415283,311,0001,098,0002,113,536
7Aug 3, 2026 20:1758,157293,358,248283,876,0001,094,0002,113,536
8Aug 3, 2026 20:1758,379295,108,385284,882,0001,176,0002,113,536
9Aug 3, 2026 20:1758,966297,424,320287,823,0001,114,0002,113,536