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:35anboto1anboto1Score: 57,733Success
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:3757,592291,243,825281,039,0001,164,0002,113,536
2Aug 3, 2026 20:3757,672291,729,828281,588,0001,008,0002,113,536
3Aug 3, 2026 20:3757,677291,699,015281,424,0001,194,0002,113,536
4Aug 3, 2026 20:3757,683291,569,950281,496,0001,155,0002,113,536
5Aug 3, 2026 20:3757,733291,930,866281,782,0001,113,0002,113,536
6Aug 3, 2026 20:3757,751291,419,158281,866,0001,114,0002,113,536
7Aug 3, 2026 20:3757,811291,738,194282,223,0001,053,0002,113,536
8Aug 3, 2026 20:3758,293294,794,541284,524,0001,113,0002,113,536
9Aug 3, 2026 20:3758,396295,217,484285,030,0001,115,0002,113,536