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 06:54Josu San MartinJosu San MartinScore: 26,704Success
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 06:5426,677139,175,978129,470,0001,250,0002,113,536
2Aug 4, 2026 06:5426,687139,190,633129,517,0001,254,0002,113,536
3Aug 4, 2026 06:5426,692139,841,011129,527,0001,268,0002,113,536
4Aug 4, 2026 06:5426,697139,883,534129,561,0001,259,0002,113,536
5Aug 4, 2026 06:5426,704139,079,001129,843,0001,011,0002,113,536
6Aug 4, 2026 06:5426,706139,286,831129,591,0001,270,0002,113,536
7Aug 4, 2026 06:5426,812139,815,673130,123,0001,260,0002,113,536
8Aug 4, 2026 06:5427,066141,057,721131,594,0001,033,0002,113,536
9Aug 4, 2026 06:5427,684145,346,455134,645,0001,007,0002,113,536