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 13:04Josu San MartinJosu San MartinScore: 29,077Success
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 13:0529,037151,350,965141,029,0001,257,0002,113,536
2Aug 3, 2026 13:0529,046152,074,462141,325,0001,005,0002,113,536
3Aug 3, 2026 13:0529,053150,834,733141,092,0001,272,0002,113,536
4Aug 3, 2026 13:0529,065152,862,547141,148,0001,274,0002,113,536
5Aug 3, 2026 13:0529,077151,518,333141,232,0001,249,0002,113,536
6Aug 3, 2026 13:0529,084150,871,760141,261,0001,251,0002,113,536
7Aug 3, 2026 13:0529,099151,049,632141,578,0001,009,0002,113,536
8Aug 3, 2026 13:0529,100151,764,712141,579,0001,011,0002,113,536
9Aug 3, 2026 13:0529,649153,778,000144,007,0001,274,0002,113,536