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 3, 2026 08:23anboto1anboto1Score: 59,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 08:2458,832298,759,720287,170,0001,110,0002,113,536
2Aug 3, 2026 08:2458,876298,528,136287,380,0001,114,0002,113,536
3Aug 3, 2026 08:2458,912301,465,765287,544,0001,127,0002,113,536
4Aug 3, 2026 08:2459,092300,524,940288,425,0001,130,0002,113,536
5Aug 3, 2026 08:2459,140300,624,720288,654,0001,135,0002,113,536
6Aug 3, 2026 08:2459,195300,063,236288,940,0001,116,0002,113,536
7Aug 3, 2026 08:2460,663308,029,130296,139,0001,113,0002,113,536
8Aug 3, 2026 08:2461,378311,610,858299,639,0001,118,0002,113,536
9Aug 3, 2026 08:2461,807312,921,635301,750,0001,106,0002,113,536