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:39Josu San MartinJosu San MartinScore: 27,584Success
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:3927,526143,370,075133,857,0001,021,0002,113,536
2Aug 3, 2026 19:3927,578143,492,194133,874,0001,260,0002,113,536
3Aug 3, 2026 19:3927,579143,321,298133,863,0001,275,0002,113,536
4Aug 3, 2026 19:3927,582144,229,309134,147,0001,008,0002,113,536
5Aug 3, 2026 19:3927,584143,736,807133,901,0001,261,0002,113,536
6Aug 3, 2026 19:3927,586143,693,859133,899,0001,275,0002,113,536
7Aug 3, 2026 19:3927,588143,624,335134,183,0001,003,0002,113,536
8Aug 3, 2026 19:3927,595143,637,913133,950,0001,270,0002,113,536
9Aug 3, 2026 19:3927,619144,359,895134,210,0001,124,0002,113,536