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:05anboto1anboto1Score: 57,887Success
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:0757,804292,315,607282,079,0001,163,0002,113,536
2Aug 3, 2026 21:0757,812292,398,843282,167,0001,116,0002,113,536
3Aug 3, 2026 21:0757,821292,305,405282,239,0001,085,0002,113,536
4Aug 3, 2026 21:0757,830292,585,927282,224,0001,144,0002,113,536
5Aug 3, 2026 21:0757,887292,690,593282,550,0001,100,0002,113,536
6Aug 3, 2026 21:0757,890292,630,797282,569,0001,095,0002,113,536
7Aug 3, 2026 21:0757,961293,066,829282,841,0001,172,0002,113,536
8Aug 3, 2026 21:0758,172294,278,493283,887,0001,159,0002,113,536
9Aug 3, 2026 21:0759,637301,449,683291,222,0001,004,0002,113,536