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:10anboto1anboto1Score: 58,943Success
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:1158,384294,512,052285,066,0001,019,0002,113,536
2Aug 3, 2026 20:1158,521295,851,114285,640,0001,116,0002,113,536
3Aug 3, 2026 20:1158,524295,899,256285,577,0001,195,0002,113,536
4Aug 3, 2026 20:1158,578296,108,687285,938,0001,097,0002,113,536
5Aug 3, 2026 20:1158,943297,415,767287,604,0001,220,0002,113,536
6Aug 3, 2026 20:1158,985297,502,353287,931,0001,099,0002,113,536
7Aug 3, 2026 20:1159,104298,696,404288,504,0001,106,0002,113,536
8Aug 3, 2026 20:1159,122298,200,610288,575,0001,125,0002,113,536
9Aug 3, 2026 20:1159,419299,682,958290,002,0001,152,0002,113,536