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 29, 2026 01:37Josu San MartinJosu San MartinScore: 24,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:3924,204126,947,659117,336,0001,265,0002,113,536
2Aug 29, 2026 01:3924,204126,966,819117,355,0001,249,0002,113,536
3Aug 29, 2026 01:3924,206127,013,140117,348,0001,263,0002,113,536
4Aug 29, 2026 01:3924,207126,999,054117,369,0001,250,0002,113,536
5Aug 29, 2026 01:3924,207127,045,047117,356,0001,259,0002,113,536
6Aug 29, 2026 01:3924,261127,252,460117,625,0001,257,0002,113,536
7Aug 29, 2026 01:3924,269127,279,093117,657,0001,262,0002,113,536
8Aug 29, 2026 01:3924,336127,472,671117,973,0001,277,0002,113,536
9Aug 29, 2026 01:3930,057155,674,404146,275,0001,005,0002,113,536