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 03:25Josu San MartinJosu San MartinScore: 24,241Success
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 03:2524,205127,122,679117,340,0001,267,0002,113,536
2Aug 29, 2026 03:2524,208127,089,886117,372,0001,249,0002,113,536
3Aug 29, 2026 03:2524,209127,032,015117,362,0001,263,0002,113,536
4Aug 29, 2026 03:2524,215127,064,512117,652,0001,006,0002,113,536
5Aug 29, 2026 03:2524,241127,130,978117,610,0001,175,0002,113,536
6Aug 29, 2026 03:2524,253127,317,574117,667,0001,175,0002,113,536
7Aug 29, 2026 03:2524,266127,315,050117,657,0001,249,0002,113,536
8Aug 29, 2026 03:2524,805130,000,960120,422,0001,123,0002,113,536
9Aug 29, 2026 03:2530,040155,717,042145,941,0001,257,0002,113,536