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 15, 2026 14:36Tomislav TunkovicTomislav TunkovicScore: 32,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 14:3732,119165,834,502155,368,0002,017,00020,480
2Aug 15, 2026 14:3732,182166,168,637156,685,0001,010,00020,480
3Aug 15, 2026 14:3732,253166,600,371157,027,0001,015,00020,480
4Aug 15, 2026 14:3732,385167,813,711157,678,0001,010,00020,480
5Aug 15, 2026 14:3732,511167,806,030158,297,0001,009,00020,480
6Aug 15, 2026 14:3732,912170,472,511160,264,0001,008,00020,480
7Aug 15, 2026 14:3733,706173,720,804164,151,0001,011,00020,480
8Aug 15, 2026 14:3749,837252,585,247243,198,0001,006,00020,480
9Aug 15, 2026 14:3760,122303,159,835293,592,0001,006,00020,480