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 02:14Josu San MartinJosu San MartinScore: 36,524Success
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 02:1436,512189,077,890177,795,0001,117,0002,113,536
2Aug 1, 2026 02:1436,515189,057,451177,807,0001,117,0002,113,536
3Aug 1, 2026 02:1436,517189,306,519177,808,0001,130,0002,113,536
4Aug 1, 2026 02:1436,519189,832,158177,821,0001,124,0002,113,536
5Aug 1, 2026 02:1436,524189,189,738177,840,0001,129,0002,113,536
6Aug 1, 2026 02:1436,526189,957,589177,836,0001,145,0002,113,536
7Aug 1, 2026 02:1436,540190,620,202177,924,0001,124,0002,113,536
8Aug 1, 2026 02:1436,735190,237,835178,863,0001,140,0002,113,536
9Aug 1, 2026 02:1437,453194,388,011182,405,0001,115,0002,113,536