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 05:15Josu San MartinJosu San MartinScore: 35,789Success
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 05:1535,756185,379,284174,071,0001,134,0002,113,536
2Aug 1, 2026 05:1535,761186,219,850174,122,0001,108,0002,113,536
3Aug 1, 2026 05:1535,766185,454,182174,119,0001,135,0002,113,536
4Aug 1, 2026 05:1535,767186,070,844174,140,0001,123,0002,113,536
5Aug 1, 2026 05:1535,789186,320,352174,116,0001,251,0002,113,536
6Aug 1, 2026 05:1535,816185,648,139174,360,0001,141,0002,113,536
7Aug 1, 2026 05:1536,235188,419,318176,446,0001,108,0002,113,536
8Aug 1, 2026 05:1536,584189,504,124178,142,0001,121,0002,113,536
9Aug 1, 2026 05:1536,591190,037,993178,174,0001,125,0002,113,536