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:23NoSIMD_C#NoSIMD_C#Score: 840,454Success
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:23840,1704,144,340,7374,018,910,00097,924,0002,293,760
2Apr 23, 2025 09:23840,4544,142,686,9774,000,274,000117,949,0002,285,568
3Apr 23, 2025 09:23840,8204,148,402,4614,020,068,00099,951,0002,519,040