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 4, 2026 12:55Josu San MartinJosu San MartinScore: 26,122Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 12:5626,043136,725,586126,357,0001,254,0002,113,536
2Aug 4, 2026 12:5626,047136,102,851126,366,0001,266,0002,113,536
3Aug 4, 2026 12:5626,049136,694,809126,384,0001,260,0002,113,536
4Aug 4, 2026 12:5626,055136,694,723126,413,0001,261,0002,113,536
5Aug 4, 2026 12:5626,122137,073,595126,736,0001,265,0002,113,536
6Aug 4, 2026 12:5626,132137,102,476126,797,0001,253,0002,113,536
7Aug 4, 2026 12:5626,133137,022,376126,789,0001,267,0002,113,536
8Aug 4, 2026 12:5626,135137,116,648126,803,0001,259,0002,113,536
9Aug 4, 2026 12:5626,483138,862,537128,507,0001,262,0002,113,536