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 19:37Josu San MartinJosu San MartinScore: 27,639Success
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 19:3727,578143,672,466133,861,0001,272,0002,113,536
2Aug 3, 2026 19:3727,621144,461,100134,305,0001,040,0002,113,536
3Aug 3, 2026 19:3727,625143,821,518134,106,0001,260,0002,113,536
4Aug 3, 2026 19:3727,639144,407,710134,178,0001,255,0002,113,536
5Aug 3, 2026 19:3727,639144,856,207134,393,0001,040,0002,113,536
6Aug 3, 2026 19:3727,682144,716,866134,375,0001,268,0002,113,536
7Aug 3, 2026 19:3727,715144,253,519134,555,0001,250,0002,113,536
8Aug 3, 2026 19:3727,929145,406,262135,600,0001,253,0002,113,536
9Aug 3, 2026 19:3728,415147,409,397138,226,0001,012,0002,113,536