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 22, 2025 16:23KeefeKeefeScore: 236,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 16:23236,5121,182,563,1211,156,911,0001,998,0002,269,184
2Apr 22, 2025 16:23236,5171,187,925,6181,155,934,0002,997,0002,269,184
3Apr 22, 2025 16:23236,5211,187,476,7901,152,959,0005,994,0002,342,912
4Apr 22, 2025 16:23236,5381,185,975,7531,158,035,000999,0002,269,184
5Apr 22, 2025 16:23236,5511,182,452,7461,157,101,0001,998,0002,363,392
6Apr 22, 2025 16:23236,5521,182,101,9081,158,105,000999,0002,478,080
7Apr 22, 2025 16:23236,5961,184,707,3431,155,322,0003,997,0002,269,184
8Apr 22, 2025 16:23236,6271,187,180,6911,158,472,000999,0002,269,184
9Apr 22, 2025 16:23236,7051,193,579,5081,158,855,000999,0002,347,008