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 21, 2025 07:35NoSIMD_C#NoSIMD_C#Score: 1,152,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 07:351,151,9065,675,883,2595,531,395,000112,946,0002,306,048
2Jan 21, 2025 07:351,152,9205,680,429,8675,532,386,000116,923,0002,535,424
3Jan 21, 2025 07:351,153,4125,681,343,5035,533,809,000117,910,0002,289,664