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 listMar 24, 2026 18:24Jasper EdbrookeJasper EdbrookeScore: 1,556,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 18:241,521,13113,952,236,9674,960,451,0002,493,092,000180,224
2Mar 24, 2026 18:241,523,55114,133,687,5694,965,762,0002,499,640,000180,224
3Mar 24, 2026 18:241,525,60214,626,404,1345,038,409,0002,437,040,000180,224
4Mar 24, 2026 18:241,553,50114,308,171,4985,202,629,0002,409,524,000180,224
5Mar 24, 2026 18:241,556,74914,405,453,3235,260,459,0002,367,613,000180,224
6Mar 24, 2026 18:241,557,54014,412,590,3545,238,812,0002,393,136,000180,224
7Mar 24, 2026 18:241,558,60014,223,834,4345,316,215,0002,320,925,000180,224
8Mar 24, 2026 18:241,560,25215,377,088,9415,330,726,0002,314,511,000180,224
9Mar 24, 2026 18:241,562,90414,491,336,4065,314,793,0002,343,436,000180,224