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:06Josu San MartinJosu San MartinScore: 29,114Success
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:0729,080151,532,723141,224,0001,269,0002,113,536
2Aug 3, 2026 02:0729,080151,557,585141,216,0001,278,0002,113,536
3Aug 3, 2026 02:0729,081151,663,116141,229,0001,271,0002,113,536
4Aug 3, 2026 02:0729,093150,948,540141,301,0001,257,0002,113,536
5Aug 3, 2026 02:0729,114151,204,496141,610,0001,052,0002,113,536
6Aug 3, 2026 02:0729,133151,739,545141,741,0001,011,0002,113,536
7Aug 3, 2026 02:0729,264151,858,364142,128,0001,270,0002,113,536
8Aug 3, 2026 02:0729,396153,751,792142,774,0001,271,0002,113,536
9Aug 3, 2026 02:0729,466153,420,852143,385,0001,002,0002,113,536