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 4, 2026 01:37Josu San MartinJosu San MartinScore: 27,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 01:3827,423142,833,346133,108,0001,267,0002,113,536
2Aug 4, 2026 01:3827,467143,619,655133,336,0001,253,0002,113,536
3Aug 4, 2026 01:3827,472143,714,656133,361,0001,254,0002,113,536
4Aug 4, 2026 01:3827,492143,120,106133,680,0001,035,0002,113,536
5Aug 4, 2026 01:3827,494143,792,576133,464,0001,261,0002,113,536
6Aug 4, 2026 01:3827,496143,166,553133,472,0001,260,0002,113,536
7Aug 4, 2026 01:3827,541143,299,011133,944,0001,010,0002,113,536
8Aug 4, 2026 01:3827,676143,824,892134,611,0001,005,0002,113,536
9Aug 4, 2026 01:3827,734144,361,979134,647,0001,254,0002,113,536