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 02:02Josu San MartinJosu San MartinScore: 31,722Success
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 02:0231,556163,074,582153,373,0001,252,0002,113,536
2Aug 4, 2026 02:0231,585163,808,861153,502,0001,265,0002,113,536
3Aug 4, 2026 02:0231,596163,341,708153,568,0001,255,0002,113,536
4Aug 4, 2026 02:0231,657164,182,488153,869,0001,255,0002,113,536
5Aug 4, 2026 02:0231,722163,934,262154,185,0001,253,0002,113,536
6Aug 4, 2026 02:0231,836165,105,399154,997,0001,002,0002,113,536
7Aug 4, 2026 02:0231,842164,740,216154,765,0001,264,0002,113,536
8Aug 4, 2026 02:0231,864164,725,826155,104,0001,032,0002,113,536
9Aug 4, 2026 02:0231,904164,536,025155,067,0001,267,0002,113,536