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 14, 2026 12:10Pavel SkripkinPavel SkripkinScore: 777,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 12:10762,6643,773,806,0633,731,059,0005,996,000368,640
2Mar 14, 2026 12:10777,3083,840,590,4113,801,815,0006,995,000172,032
3Mar 14, 2026 12:10777,4983,841,459,4983,802,745,0006,995,000172,032
4Mar 14, 2026 12:10777,7343,840,989,3473,804,901,0005,996,000413,696
5Mar 14, 2026 12:10777,7893,838,353,4993,804,171,0006,996,000217,088
6Mar 14, 2026 12:10777,8463,840,600,7723,805,449,0005,997,0002,437,120
7Mar 14, 2026 12:10777,9233,846,756,5093,805,824,0005,998,000217,088
8Mar 14, 2026 12:10778,0973,840,705,5593,805,681,0006,995,000172,032
9Mar 14, 2026 12:10778,1753,841,107,3163,806,060,0006,996,000413,696