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 1, 2026 22:39Josu San MartinJosu San MartinScore: 32,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 22:4032,646170,155,754158,840,0001,126,0002,113,536
2Aug 1, 2026 22:4032,654170,469,579158,861,0001,148,0002,113,536
3Aug 1, 2026 22:4032,673170,201,374158,991,0001,110,0002,113,536
4Aug 1, 2026 22:4032,684171,063,096159,013,0001,141,0002,113,536
5Aug 1, 2026 22:4032,718170,474,308159,198,0001,121,0002,113,536
6Aug 1, 2026 22:4032,731171,232,906159,238,0001,147,0002,113,536
7Aug 1, 2026 22:4032,785171,589,876159,516,0001,135,0002,113,536
8Aug 1, 2026 22:4032,788170,845,905159,537,0001,128,0002,113,536
9Aug 1, 2026 22:4032,797170,832,246159,593,0001,117,0002,113,536