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 20:39anboto1anboto1Score: 57,726Success
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 20:4157,551291,110,060280,879,0001,125,0002,113,536
2Aug 3, 2026 20:4157,666290,984,441281,443,0001,125,0002,113,536
3Aug 3, 2026 20:4157,683291,644,993281,526,0001,121,0002,113,536
4Aug 3, 2026 20:4157,707294,308,704281,559,0001,209,0002,113,536
5Aug 3, 2026 20:4157,726293,409,318281,627,0001,234,0002,113,536
6Aug 3, 2026 20:4157,762291,229,737281,864,0001,171,0002,113,536
7Aug 3, 2026 20:4157,968293,084,224282,931,0001,116,0002,113,536
8Aug 3, 2026 20:4158,954297,912,042287,721,0001,155,0002,113,536
9Aug 3, 2026 20:4159,130298,859,637288,633,0001,107,0002,113,536