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:46anboto1anboto1Score: 57,773Success
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:4857,736291,716,937281,745,0001,162,0002,113,536
2Aug 3, 2026 20:4857,754291,447,461281,886,0001,110,0002,113,536
3Aug 3, 2026 20:4857,761291,456,437281,838,0001,191,0002,113,536
4Aug 3, 2026 20:4857,771291,542,097281,840,0001,238,0002,113,536
5Aug 3, 2026 20:4857,773291,464,477281,967,0001,123,0002,113,536
6Aug 3, 2026 20:4857,782291,560,966282,002,0001,134,0002,113,536
7Aug 3, 2026 20:4857,789292,208,331282,052,0001,117,0002,113,536
8Aug 3, 2026 20:4857,833291,891,936282,203,0001,179,0002,113,536
9Aug 3, 2026 20:4857,944292,618,532282,728,0001,198,0002,113,536