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 1, 2026 15:29Josu San MartinJosu San MartinScore: 32,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 15:3032,121168,289,863156,293,0001,104,0002,113,536
2Aug 1, 2026 15:3032,147168,442,446156,407,0001,117,0002,113,536
3Aug 1, 2026 15:3032,158168,432,020156,469,0001,110,0002,113,536
4Aug 1, 2026 15:3032,158167,716,684156,456,0001,120,0002,113,536
5Aug 1, 2026 15:3032,162167,647,471156,472,0001,124,0002,113,536
6Aug 1, 2026 15:3032,167167,736,143156,491,0001,131,0002,113,536
7Aug 1, 2026 15:3032,172168,081,637156,527,0001,116,0002,113,536
8Aug 1, 2026 15:3032,175168,542,730156,527,0001,132,0002,113,536
9Aug 1, 2026 15:3032,186167,837,889156,593,0001,123,0002,113,536