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 3, 2025 05:29NoSIMD_C#NoSIMD_C#Score: 1,273,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:291,273,4216,266,856,3976,234,766,0004,997,0002,527,232
2Feb 3, 2025 05:291,273,5946,269,013,5206,238,612,0001,998,0002,523,136
3Feb 3, 2025 05:291,273,9866,274,848,9456,241,530,000999,0002,428,928