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:15Pavel SkripkinPavel SkripkinScore: 776,962Success
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:15776,0253,836,294,5463,797,525,0004,998,0002,269,184
2Mar 14, 2026 12:15776,6803,831,938,0353,801,732,0003,998,000262,144
3Mar 14, 2026 12:15776,8983,840,550,9233,802,802,0003,997,000266,240
4Mar 14, 2026 12:15776,9343,831,028,4553,803,977,0002,998,0002,269,184
5Mar 14, 2026 12:15776,9623,835,189,1723,802,117,0004,997,0002,531,328
6Mar 14, 2026 12:15777,2233,830,695,7463,803,397,0004,997,000172,032
7Mar 14, 2026 12:15777,3203,834,986,2293,802,874,0005,996,000172,032
8Mar 14, 2026 12:15777,7633,838,486,3173,805,044,0005,996,000368,640
9Mar 14, 2026 12:15778,0573,843,232,7643,806,484,0005,997,000430,080