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 1, 2026 00:56anboto1anboto1Score: 181,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 00:57181,350898,976,583887,473,0001,144,0002,113,536
2Aug 1, 2026 00:57181,454899,441,836887,976,0001,153,0002,113,536
3Aug 1, 2026 00:57181,724900,660,133889,177,0001,271,0002,113,536
4Aug 1, 2026 00:57181,897901,670,522890,162,0001,138,0002,113,536
5Aug 1, 2026 00:57181,945901,794,210890,385,0001,147,0002,113,536
6Aug 1, 2026 00:57182,232903,199,342891,809,0001,129,0002,113,536
7Aug 1, 2026 00:57182,545904,659,170893,320,0001,153,0002,113,536
8Aug 1, 2026 00:57182,730905,591,094894,244,0001,133,0002,113,536
9Aug 1, 2026 00:57182,939906,484,626895,259,0001,145,0002,113,536