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 20:37Tomislav TunkovicTomislav TunkovicScore: 30,362Success
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 20:3829,770155,060,686144,865,0001,009,00020,480
2Aug 15, 2026 20:3829,771155,103,016144,871,0001,011,00020,480
3Aug 15, 2026 20:3830,068156,858,489145,302,0002,035,00020,480
4Aug 15, 2026 20:3830,100156,688,446146,483,0001,009,00020,480
5Aug 15, 2026 20:3830,362157,858,571147,764,0001,011,00020,480
6Aug 15, 2026 20:3830,801160,057,091149,915,0001,012,00020,480
7Aug 15, 2026 20:3830,816159,682,788149,992,0001,010,00020,480
8Aug 15, 2026 20:3832,868169,553,459160,047,0001,011,00020,480
9Aug 15, 2026 20:3838,817198,767,306189,202,0001,006,00020,480