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 listJan 23, 2025 08:32NoSIMD_C#NoSIMD_C#Score: 1,151,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:321,150,5525,672,444,9585,526,768,000110,935,0002,293,760
2Jan 23, 2025 08:321,151,0865,698,329,1375,510,382,000129,938,0002,289,664
3Jan 23, 2025 08:321,151,6155,771,477,2755,527,224,000115,690,0002,289,664