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 17, 2024 20:36Hal FHal FError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2024 20:3400000Error: expected "560376379896 ", got "560376382056 "stderr
2Apr 17, 2024 20:36305,7421,562,122,8601,498,137,93602,269,184
3Apr 17, 2024 20:36305,7521,563,183,5511,498,187,04102,273,280
4Apr 17, 2024 20:36305,7891,559,913,3511,498,366,81202,269,184