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 17:25Josu San MartinJosu San MartinScore: 25,866Success
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 17:2525,804135,367,589125,185,0001,259,0002,113,536
2Aug 4, 2026 17:2525,824135,599,058125,283,0001,258,0002,113,536
3Aug 4, 2026 17:2525,854135,780,223125,431,0001,254,0002,113,536
4Aug 4, 2026 17:2525,860135,801,118125,449,0001,267,0002,113,536
5Aug 4, 2026 17:2525,866135,844,015125,500,0001,247,0002,113,536
6Aug 4, 2026 17:2525,866135,750,852125,495,0001,253,0002,113,536
7Aug 4, 2026 17:2525,879135,810,563125,696,0001,112,0002,113,536
8Aug 4, 2026 17:2525,932136,077,244125,818,0001,250,0002,113,536
9Aug 4, 2026 17:2526,018136,541,085126,237,0001,252,0002,113,536