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 15, 2024 15:49NoSIMD_C#NoSIMD_C#Score: 1,509,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 15:491,508,9877,426,794,3857,244,159,000149,879,0002,367,488
2Nov 15, 2024 15:491,509,3707,435,901,9447,237,068,000158,847,0002,306,048
3Nov 15, 2024 15:491,511,8107,445,028,6857,269,005,000138,866,0002,535,424