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 21:21anboto1anboto1Score: 57,906Success
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 21:2257,581290,348,589281,048,0001,099,0002,113,536
2Aug 3, 2026 21:2257,609291,315,012281,196,0001,091,0002,113,536
3Aug 3, 2026 21:2257,627291,362,427281,297,0001,076,0002,113,536
4Aug 3, 2026 21:2257,697291,823,619281,554,0001,164,0002,113,536
5Aug 3, 2026 21:2257,906292,127,380282,645,0001,097,0002,113,536
6Aug 3, 2026 21:2257,961292,426,566282,916,0001,095,0002,113,536
7Aug 3, 2026 21:2258,703296,112,458286,554,0001,093,0002,113,536
8Aug 3, 2026 21:2258,753296,385,346286,708,0001,185,0002,113,536
9Aug 3, 2026 21:2259,134299,547,388288,721,0001,040,0002,113,536