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 3, 2026 02:27Josu San MartinJosu San MartinScore: 29,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 02:2729,018151,257,291140,928,0001,263,0002,113,536
2Aug 3, 2026 02:2729,026151,273,528140,966,0001,263,0002,113,536
3Aug 3, 2026 02:2729,027150,656,564140,976,0001,261,0002,113,536
4Aug 3, 2026 02:2729,028150,721,139140,968,0001,273,0002,113,536
5Aug 3, 2026 02:2729,037150,887,603141,020,0001,266,0002,113,536
6Aug 3, 2026 02:2729,048151,404,769141,063,0001,275,0002,113,536
7Aug 3, 2026 02:2729,048150,545,821141,323,0001,013,0002,113,536
8Aug 3, 2026 02:2729,410152,506,973142,838,0001,271,0002,113,536
9Aug 3, 2026 02:2729,460152,583,427143,315,0001,042,0002,113,536