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 8, 2024 11:33IhebIhebScore: 623,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2024 11:33623,8573,117,889,7563,056,898,64602,252,800
2Mar 8, 2024 10:43623,8953,121,314,1253,057,086,68102,256,896
3Mar 8, 2024 10:43623,9453,111,512,9053,057,331,77302,240,512
4Mar 8, 2024 11:33623,9533,122,059,8383,057,367,35802,260,992
5Mar 8, 2024 10:43623,9563,129,728,2073,057,386,18702,265,088
6Mar 8, 2024 11:33623,9843,117,675,7963,057,521,12502,260,992