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:34anboto1anboto1Score: 57,750Success
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:3657,559290,679,878280,938,0001,102,0002,113,536
2Aug 3, 2026 20:3657,623290,863,614281,257,0001,096,0002,113,536
3Aug 3, 2026 20:3657,697291,170,981281,626,0001,091,0002,113,536
4Aug 3, 2026 20:3657,728292,013,355281,685,0001,186,0002,113,536
5Aug 3, 2026 20:3657,750291,405,905281,882,0001,095,0002,113,536
6Aug 3, 2026 20:3657,861292,617,797282,295,0001,227,0002,113,536
7Aug 3, 2026 20:3657,950292,565,555282,787,0001,172,0002,113,536
8Aug 3, 2026 20:3658,749296,320,121286,781,0001,093,0002,113,536
9Aug 3, 2026 20:3658,800297,219,185287,018,0001,102,0002,113,536