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 listDec 24, 2023 03:46matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 03:4600000Error: expected "560372938886 ", got "4916611661914090107 58546851001532444 -1332460171599450750 2752512 0 0 334 165 171 "
2Dec 24, 2023 03:4700000Error: expected "560383777912 ", got "4038035569447532403 43629574876954624 527480970030582431 3473408 0 0 322 151 184 "
3Dec 24, 2023 03:4800000Error: expected "560380933082 ", got "7740619842873809082 42784316724019208 -530656478064695361 458752 0 0 321 162 133 "