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 16:09Josu San MartinJosu San MartinScore: 25,220Success
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 16:1025,160131,674,509122,031,0001,255,0002,113,536
2Aug 4, 2026 16:1025,169132,532,543122,078,0001,253,0002,113,536
3Aug 4, 2026 16:1025,204132,498,364122,464,0001,036,0002,113,536
4Aug 4, 2026 16:1025,209132,031,512122,517,0001,009,0002,113,536
5Aug 4, 2026 16:1025,220132,107,218122,564,0001,018,0002,113,536
6Aug 4, 2026 16:1025,230132,030,776122,353,0001,277,0002,113,536
7Aug 4, 2026 16:1025,244133,495,993122,673,0001,025,0002,113,536
8Aug 4, 2026 16:1025,514134,080,385123,773,0001,247,0002,113,536
9Aug 4, 2026 16:1027,551143,423,141133,743,0001,257,0002,113,536