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 listFeb 13, 2026 15:27olliecrowolliecrowScore: 212,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 15:27211,5251,066,376,4491,033,476,0002,998,0002,285,568
2Feb 13, 2026 15:27212,5101,070,808,2561,037,301,0003,997,0002,498,560
3Feb 13, 2026 15:27213,7101,073,762,1711,044,180,0002,997,0002,285,568