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 05:03Josu San MartinJosu San MartinScore: 27,139Success
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 05:0327,115141,518,244131,611,0001,256,0002,113,536
2Aug 4, 2026 05:0327,126143,286,398131,646,0001,273,0002,113,536
3Aug 4, 2026 05:0327,128141,158,764131,908,0001,024,0002,113,536
4Aug 4, 2026 05:0327,138141,378,691131,724,0001,257,0002,113,536
5Aug 4, 2026 05:0327,139141,509,033131,920,0001,065,0002,113,536
6Aug 4, 2026 05:0327,144141,504,226131,751,0001,259,0002,113,536
7Aug 4, 2026 05:0327,157141,592,009132,031,0001,041,0002,113,536
8Aug 4, 2026 05:0327,160142,039,937132,025,0001,059,0002,113,536
9Aug 4, 2026 05:0327,170141,585,895131,998,0001,137,0002,113,536