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 13:27Josu San MartinJosu San MartinScore: 25,396Success
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 13:2825,341132,615,195122,922,0001,253,0002,113,536
2Aug 4, 2026 13:2825,351132,766,316122,961,0001,260,0002,113,536
3Aug 4, 2026 13:2825,359132,658,888123,242,0001,019,0002,113,536
4Aug 4, 2026 13:2825,387134,233,265123,136,0001,262,0002,113,536
5Aug 4, 2026 13:2825,396132,934,610123,416,0001,026,0002,113,536
6Aug 4, 2026 13:2825,586133,826,594124,309,0001,067,0002,113,536
7Aug 4, 2026 13:2825,657134,160,747124,540,0001,183,0002,113,536
8Aug 4, 2026 13:2825,908135,414,690125,685,0001,268,0002,113,536
9Aug 4, 2026 13:2826,475138,377,330128,692,0001,037,0002,113,536