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 listAug 28, 2026 15:28C#_userC#_userScore: 836,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:32835,7934,105,174,9213,988,213,000107,175,0002,142,208
2Aug 28, 2026 15:32835,8644,105,483,2383,987,704,000108,034,0002,138,112
3Aug 28, 2026 15:32836,0974,106,757,5943,989,669,000107,208,0002,142,208
4Aug 28, 2026 15:32836,1304,106,973,3463,989,225,000107,812,0002,142,208
5Aug 28, 2026 15:32836,1704,107,076,6473,990,414,000106,819,0002,138,112
6Aug 28, 2026 15:32836,2134,107,157,6463,989,263,000108,183,0002,142,208
7Aug 28, 2026 15:32836,2304,107,293,3473,988,684,000108,844,0002,142,208
8Aug 28, 2026 15:32836,2964,109,081,4633,988,814,000109,037,0002,142,208
9Aug 28, 2026 15:32836,5684,108,912,7933,990,043,000109,145,0002,199,552