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 15:20Josu San MartinJosu San MartinScore: 32,607Success
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 15:2132,586169,757,043158,550,0001,123,0002,113,536
2Aug 1, 2026 15:2132,597169,913,447158,629,0001,101,0002,113,536
3Aug 1, 2026 15:2132,605169,826,365158,662,0001,103,0002,113,536
4Aug 1, 2026 15:2132,605170,637,626158,661,0001,107,0002,113,536
5Aug 1, 2026 15:2132,607169,895,145158,651,0001,124,0002,113,536
6Aug 1, 2026 15:2132,610170,654,899158,689,0001,103,0002,113,536
7Aug 1, 2026 15:2132,613169,919,893158,701,0001,107,0002,113,536
8Aug 1, 2026 15:2132,615169,886,213158,700,0001,114,0002,113,536
9Aug 1, 2026 15:2132,618169,963,451158,720,0001,112,0002,113,536