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 16:39Josu San MartinJosu San MartinScore: 27,562Success
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 16:3927,528143,940,342133,628,0001,262,0002,113,536
2Aug 3, 2026 16:3927,541143,201,742133,702,0001,252,0002,113,536
3Aug 3, 2026 16:3927,543143,206,305133,718,0001,246,0002,113,536
4Aug 3, 2026 16:3927,547143,433,249133,734,0001,250,0002,113,536
5Aug 3, 2026 16:3927,562143,371,098133,789,0001,267,0002,113,536
6Aug 3, 2026 16:3927,562143,361,687133,783,0001,274,0002,113,536
7Aug 3, 2026 16:3927,592143,412,728133,934,0001,268,0002,113,536
8Aug 3, 2026 16:3927,617143,871,710134,078,0001,249,0002,113,536
9Aug 3, 2026 16:3927,870145,003,719135,304,0001,261,0002,113,536