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 listJan 16, 2025 00:59Ian MckibbenIan MckibbenScore: 830,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 00:59830,0144,099,156,1244,064,070,0002,998,0002,289,664
2Jan 16, 2025 00:59830,0234,098,018,4074,064,114,0002,997,0002,281,472
3Jan 16, 2025 00:59830,0274,097,908,3744,064,137,0002,997,0002,273,280
4Jan 16, 2025 00:59830,0334,096,700,7484,064,166,0002,998,0002,273,280
5Jan 16, 2025 00:59830,0494,097,510,9824,065,240,0001,998,0002,289,664
6Jan 16, 2025 00:59830,0724,098,519,0784,066,353,000999,0002,289,664
7Jan 16, 2025 00:59830,0834,094,236,5714,064,407,0002,998,0002,289,664
8Jan 16, 2025 00:59830,0864,098,203,9384,064,421,0002,998,0002,281,472
9Jan 16, 2025 00:59830,1144,091,959,1704,064,563,0002,998,0002,281,472