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 29, 2025 11:08NoSIMD_C#NoSIMD_C#Score: 1,089,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 11:081,089,2115,369,341,1935,334,137,0002,998,0002,273,280
2Dec 4, 2024 11:591,089,5375,368,967,8905,335,733,0002,998,0002,273,280
3Dec 4, 2024 11:591,089,6845,369,686,4295,338,454,000999,0002,273,280
4Jan 29, 2025 11:081,089,6865,381,482,7885,337,462,0001,998,0002,277,376
5Jan 29, 2025 11:081,090,0825,372,763,4045,339,404,0001,999,0002,277,376
6Dec 4, 2024 11:591,091,6105,378,024,1705,346,891,0001,998,0002,273,280