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 9, 2025 17:33NoSIMD_C#NoSIMD_C#Score: 840,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 17:33840,6374,150,787,6444,002,176,000116,946,0002,375,680
2Apr 9, 2025 17:33840,6374,147,574,0864,005,203,000113,920,0002,469,888
3Apr 9, 2025 17:33840,9054,148,989,6764,004,507,000115,927,0002,293,760