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:07anboto1anboto1Score: 57,672Success
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:0857,561290,498,228280,959,0001,090,0002,113,536
2Aug 3, 2026 21:0857,581290,633,159281,021,0001,129,0002,113,536
3Aug 3, 2026 21:0857,586291,240,851281,084,0001,090,0002,113,536
4Aug 3, 2026 21:0857,656292,491,513281,300,0001,216,0002,113,536
5Aug 3, 2026 21:0857,672291,053,011281,471,0001,126,0002,113,536
6Aug 3, 2026 21:0857,750291,973,137281,796,0001,181,0002,113,536
7Aug 3, 2026 21:0857,756293,540,351281,847,0001,162,0002,113,536
8Aug 3, 2026 21:0857,950293,292,430282,846,0001,109,0002,113,536
9Aug 3, 2026 21:0858,915297,130,233287,600,0001,085,0002,113,536