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 23, 2025 09:21NoSIMD_C#NoSIMD_C#Score: 840,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 09:21840,0524,143,600,5204,004,304,000111,952,0002,297,856
2Apr 23, 2025 09:21840,2774,145,983,1964,001,430,000115,925,0002,293,760
3Apr 23, 2025 09:21840,6474,147,855,1794,003,249,000115,920,0002,293,760