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:18anboto1anboto1Score: 59,057Success
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:1858,761296,994,688286,734,0001,196,0002,113,536
2Aug 3, 2026 20:1858,768297,022,662286,812,0001,154,0002,113,536
3Aug 3, 2026 20:1858,883297,570,367287,438,0001,089,0002,113,536
4Aug 3, 2026 20:1859,037298,365,684288,188,0001,094,0002,113,536
5Aug 3, 2026 20:1859,057297,984,439288,263,0001,118,0002,113,536
6Aug 3, 2026 20:1859,068297,929,714288,314,0001,122,0002,113,536
7Aug 3, 2026 20:1859,164299,092,566288,784,0001,121,0002,113,536
8Aug 3, 2026 20:1859,181299,054,724288,852,0001,135,0002,113,536
9Aug 3, 2026 20:1859,796301,444,873291,878,0001,125,0002,113,536