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:21anboto1anboto1Score: 59,722Success
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:2259,594301,097,072290,925,0001,087,0002,113,536
2Aug 3, 2026 20:2259,616300,608,482291,033,0001,090,0002,113,536
3Aug 3, 2026 20:2259,684301,612,829291,296,0001,157,0002,113,536
4Aug 3, 2026 20:2259,686301,625,015291,188,0001,276,0002,113,536
5Aug 3, 2026 20:2259,722301,670,247291,540,0001,098,0002,113,536
6Aug 3, 2026 20:2259,736301,148,292291,560,0001,148,0002,113,536
7Aug 3, 2026 20:2259,791301,446,076291,820,0001,160,0002,113,536
8Aug 3, 2026 20:2259,858301,721,939292,214,0001,093,0002,113,536
9Aug 3, 2026 20:2259,945303,540,873292,503,0001,230,0002,113,536