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 10, 2025 15:54Advait IyerAdvait IyerScore: 994,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 15:54994,0974,900,220,7034,869,074,0001,999,0002,285,568
2Jan 10, 2025 15:54994,3654,905,360,1284,870,392,0001,998,0002,289,664
3Jan 10, 2025 15:54994,4144,901,216,8684,869,633,0002,998,0002,285,568
4Jan 10, 2025 15:54994,5334,905,974,6694,870,213,0002,998,0002,285,568
5Jan 10, 2025 15:54994,7424,908,148,6894,871,240,0002,998,0002,285,568
6Jan 10, 2025 15:54994,7504,906,320,4514,870,278,0003,997,0002,285,568
7Jan 10, 2025 15:54994,7774,902,819,7134,871,407,0002,998,0002,285,568
8Jan 10, 2025 15:54994,8594,906,386,7954,872,809,0001,998,0002,293,760
9Jan 10, 2025 15:54994,9124,903,642,6464,872,073,0002,998,0002,293,760