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:25anboto1anboto1Score: 57,725Success
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:2557,558291,759,680280,934,0001,105,0002,113,536
2Aug 3, 2026 21:2557,578291,483,324281,031,0001,105,0002,113,536
3Aug 3, 2026 21:2557,597291,308,519281,138,0001,088,0002,113,536
4Aug 3, 2026 21:2557,612290,993,416281,175,0001,125,0002,113,536
5Aug 3, 2026 21:2557,725291,779,364281,685,0001,170,0002,113,536
6Aug 3, 2026 21:2557,751291,476,758281,896,0001,086,0002,113,536
7Aug 3, 2026 21:2557,774291,567,389282,002,0001,093,0002,113,536
8Aug 3, 2026 21:2557,995297,416,890283,075,0001,105,0002,113,536
9Aug 3, 2026 21:2558,299294,173,575284,571,0001,098,0002,113,536