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 26, 2026 02:02Jasper EdbrookeJasper EdbrookeScore: 936,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 02:02915,93310,664,347,8432,074,945,0002,413,129,000180,224
2Mar 26, 2026 02:02918,22310,913,921,6452,113,167,0002,386,126,000200,704
3Mar 26, 2026 02:02918,43311,827,847,9802,118,215,0002,382,107,000188,416
4Mar 26, 2026 02:02930,03811,172,160,7712,308,197,0002,248,988,000180,224
5Mar 26, 2026 02:02936,75311,390,549,6142,154,765,0002,435,324,000180,224
6Mar 26, 2026 02:02937,48212,331,030,2682,181,478,0002,412,182,000180,224
7Mar 26, 2026 02:02937,63212,853,391,2452,055,897,0002,538,498,000180,224
8Mar 26, 2026 02:02946,20611,810,056,4632,203,003,0002,433,408,000217,088
9Mar 26, 2026 02:02946,69812,236,839,2372,222,962,0002,415,859,000180,224