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 4, 2026 07:46Josu San MartinJosu San MartinScore: 26,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:4726,014135,977,418126,207,0001,265,0002,113,536
2Aug 4, 2026 07:4726,063136,107,645126,443,0001,269,0002,113,536
3Aug 4, 2026 07:4726,068136,175,118126,732,0001,005,0002,113,536
4Aug 4, 2026 07:4726,092136,258,829126,598,0001,256,0002,113,536
5Aug 4, 2026 07:4726,100137,923,436126,885,0001,005,0002,113,536
6Aug 4, 2026 07:4726,107136,417,213126,656,0001,271,0002,113,536
7Aug 4, 2026 07:4726,144136,504,935127,068,0001,042,0002,113,536
8Aug 4, 2026 07:4726,161136,717,457126,932,0001,257,0002,113,536
9Aug 4, 2026 07:4726,430137,957,454128,248,0001,259,0002,113,536