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:31IhebIhebScore: 856,050Success
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:31855,9984,253,009,9324,194,390,85502,260,992
2Mar 8, 2024 10:50856,0294,264,867,6424,194,542,80202,260,992
3Mar 8, 2024 10:50856,0484,264,919,9454,194,633,03402,260,992
4Mar 8, 2024 11:31856,0504,258,803,6474,194,644,36802,260,992
5Mar 8, 2024 11:31856,0614,268,911,8544,194,697,22502,260,992
6Mar 8, 2024 10:50869,3404,326,032,0554,259,768,24702,256,896