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 listNov 10, 2024 08:23E SequeiraE SequeiraScore: 815,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 08:23815,2404,026,668,5663,991,676,0002,998,0002,404,352
2Nov 10, 2024 08:23815,2684,026,853,4493,990,816,0003,996,0002,461,696
3Nov 10, 2024 08:23815,2704,027,045,3813,991,825,0002,998,0002,465,792