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 listApr 30, 2024 04:49matsuoka-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
1Apr 30, 2024 04:4900000Error: expected "560374679595 ", got "000 0 55169492487459912 51333 "stderr
2Apr 30, 2024 04:5000000Error: expected "560377426568 ", got "000 0 6825417496699548052 350851 "stderr
3Apr 30, 2024 04:5600000Error: expected "560381840072 ", got "000 0 3326810222 57017 "stderr
4Apr 30, 2024 04:5600000Error: expected "560383279280 ", got "000 0 -364008330867568805 214427 "stderr