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 29, 2026 01:27Josu San MartinJosu San MartinScore: 24,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:2724,198126,990,985117,317,0001,258,0002,113,536
2Aug 29, 2026 01:2724,203126,996,553117,325,0001,274,0002,113,536
3Aug 29, 2026 01:2724,207127,546,500117,365,0001,253,0002,113,536
4Aug 29, 2026 01:2724,207127,044,503117,344,0001,271,0002,113,536
5Aug 29, 2026 01:2724,208127,614,069117,350,0001,270,0002,113,536
6Aug 29, 2026 01:2724,208126,941,982117,367,0001,254,0002,113,536
7Aug 29, 2026 01:2724,211127,136,395117,368,0001,268,0002,113,536
8Aug 29, 2026 01:2724,217127,131,820117,404,0001,260,0002,113,536
9Aug 29, 2026 01:2724,223127,124,902117,655,0001,040,0002,113,536