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 8, 2025 06:35NoSIMD_C#NoSIMD_C#Score: 583,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 06:35583,9342,888,539,4482,859,278,0001,998,0002,281,472
2Apr 8, 2025 06:35583,9582,884,593,9342,859,394,0001,998,0002,277,376
3Apr 8, 2025 06:35583,9812,886,030,1502,858,511,0002,998,0002,265,088