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 22:10Josu San MartinJosu San MartinScore: 31,703Success
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 22:1131,473162,663,022152,960,0001,258,0002,113,536
2Aug 3, 2026 22:1131,511162,811,079153,133,0001,271,0002,113,536
3Aug 3, 2026 22:1131,687164,306,649154,013,0001,257,0002,113,536
4Aug 3, 2026 22:1131,691163,699,354154,279,0001,011,0002,113,536
5Aug 3, 2026 22:1131,703163,710,739154,093,0001,256,0002,113,536
6Aug 3, 2026 22:1131,718163,873,205154,146,0001,274,0002,113,536
7Aug 3, 2026 22:1131,728163,893,426154,200,0001,270,0002,113,536
8Aug 3, 2026 22:1131,742164,004,027154,266,0001,273,0002,113,536
9Aug 3, 2026 22:1143,320220,705,913211,165,0001,105,0002,113,536