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 listNov 10, 2024 08:10E SequeiraE SequeiraScore: 781,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 08:10781,3703,859,529,0593,826,714,0001,998,0002,514,944
2Nov 10, 2024 08:10781,4163,854,990,3593,825,941,0002,998,0002,523,136
3Nov 10, 2024 08:10781,4393,858,066,0303,827,052,0001,998,0002,285,568
4Nov 10, 2024 08:10781,4433,857,557,3663,827,074,0001,998,0002,285,568
5Nov 10, 2024 08:10781,4643,863,506,8803,826,178,0002,997,0002,285,568
6Nov 10, 2024 08:10781,4973,858,526,2223,825,336,0003,997,0002,285,568
7Nov 10, 2024 08:10781,5113,860,173,8533,827,408,0001,998,0002,514,944
8Nov 10, 2024 08:10781,5223,860,291,6243,827,458,0001,998,0002,285,568
9Nov 10, 2024 08:10781,5363,858,749,7873,826,527,0002,998,0002,519,040