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 16:21Josu San MartinJosu San MartinScore: 25,155Success
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 16:2225,127132,808,264121,873,0001,254,0002,113,536
2Aug 4, 2026 16:2225,132132,904,060121,892,0001,255,0002,113,536
3Aug 4, 2026 16:2225,132132,137,117121,892,0001,257,0002,113,536
4Aug 4, 2026 16:2225,152132,321,891121,978,0001,271,0002,113,536
5Aug 4, 2026 16:2225,155132,361,222121,997,0001,263,0002,113,536
6Aug 4, 2026 16:2225,157131,681,001122,013,0001,260,0002,113,536
7Aug 4, 2026 16:2225,169131,814,024122,064,0001,265,0002,113,536
8Aug 4, 2026 16:2225,187131,845,986122,160,0001,261,0002,113,536
9Aug 4, 2026 16:2225,188131,852,498122,257,0001,166,0002,113,536