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 1, 2026 04:45anboto1anboto1Score: 336,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 04:45336,7351,660,295,5351,648,869,0001,137,0002,113,536
2Aug 1, 2026 04:45336,8021,660,608,1721,649,186,0001,147,0002,113,536
3Aug 1, 2026 04:45336,8901,661,036,0341,649,640,0001,121,0002,113,536
4Aug 1, 2026 04:45336,9431,662,215,2691,648,887,0002,135,0002,113,536
5Aug 1, 2026 04:45336,9521,661,231,9861,649,937,0001,129,0002,113,536
6Aug 1, 2026 04:45336,9571,661,347,5611,649,958,0001,136,0002,113,536
7Aug 1, 2026 04:45337,1431,672,596,7621,650,850,0001,153,0002,113,536
8Aug 1, 2026 04:45337,3301,671,112,8971,651,748,0001,172,0002,113,536
9Aug 1, 2026 04:45337,5571,675,226,0941,652,811,0001,221,0002,113,536