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:29Josu San MartinJosu San MartinScore: 24,206Success
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:3024,189127,033,560117,260,0001,267,0002,113,536
2Aug 29, 2026 03:3024,192127,003,285117,278,0001,266,0002,113,536
3Aug 29, 2026 03:3024,199126,991,257117,314,0001,262,0002,113,536
4Aug 29, 2026 03:3024,203127,086,237117,350,0001,248,0002,113,536
5Aug 29, 2026 03:3024,206126,986,916117,352,0001,259,0002,113,536
6Aug 29, 2026 03:3024,207127,052,043117,370,0001,248,0002,113,536
7Aug 29, 2026 03:3024,209127,080,048117,368,0001,258,0002,113,536
8Aug 29, 2026 03:3024,514129,170,663118,871,0001,251,0002,113,536
9Aug 29, 2026 03:3024,536128,721,292118,952,0001,277,0002,113,536