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 4, 2024 10:18matsuoka-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
1Jan 4, 2024 10:1800000Error: expected "560372530092 ", got "0 0 0 393 -7984946710939668289 0 "
2Jan 4, 2024 10:1900000Error: expected "560379036544 ", got "0 0 0 330 -803497667253015262 0 "
3Jan 4, 2024 10:2000000Error: expected "560373030090 ", got "0 0 0 330 -1641703814945561743 0 "