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 17:22Josu San MartinJosu San MartinScore: 27,381Success
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 17:2227,360143,190,852132,796,0001,272,0002,113,536
2Aug 3, 2026 17:2227,362143,194,835132,810,0001,266,0002,113,536
3Aug 3, 2026 17:2227,367143,214,491133,083,0001,019,0002,113,536
4Aug 3, 2026 17:2227,368148,294,569132,848,0001,258,0002,113,536
5Aug 3, 2026 17:2227,381143,331,084132,892,0001,275,0002,113,536
6Aug 3, 2026 17:2227,384142,617,690132,924,0001,258,0002,113,536
7Aug 3, 2026 17:2227,575144,155,935133,862,0001,256,0002,113,536
8Aug 3, 2026 17:2227,592143,658,900133,939,0001,263,0002,113,536
9Aug 3, 2026 17:2228,183147,137,333137,097,0001,004,0002,113,536