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 3, 2026 20:09anboto1anboto1Score: 58,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:1058,068293,601,467283,443,0001,094,0002,113,536
2Aug 3, 2026 20:1058,100293,810,405283,494,0001,196,0002,113,536
3Aug 3, 2026 20:1058,191294,233,573283,984,0001,156,0002,113,536
4Aug 3, 2026 20:1058,215294,340,876284,152,0001,105,0002,113,536
5Aug 3, 2026 20:1058,685298,038,469286,460,0001,101,0002,113,536
6Aug 3, 2026 20:1058,775297,063,565286,895,0001,106,0002,113,536
7Aug 3, 2026 20:1058,796297,176,705286,992,0001,109,0002,113,536
8Aug 3, 2026 20:1058,800296,855,040286,971,0001,151,0002,113,536
9Aug 3, 2026 20:1059,527300,112,306290,589,0001,098,0002,113,536