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 listFeb 28, 2025 05:24NoSIMD_C#NoSIMD_C#Score: 1,150,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2025 05:241,150,1385,668,560,3635,520,723,000114,952,0002,301,952
2Feb 28, 2025 05:241,150,4715,667,987,8145,518,363,000118,943,0002,285,568
3Feb 28, 2025 05:241,150,5035,668,778,6715,513,520,000123,944,0002,535,424