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 07:39Josu San MartinJosu San MartinScore: 26,618Success
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 07:4026,576138,689,661128,961,0001,262,0002,113,536
2Aug 4, 2026 07:4026,594138,755,403129,072,0001,242,0002,113,536
3Aug 4, 2026 07:4026,610138,821,502129,202,0001,190,0002,113,536
4Aug 4, 2026 07:4026,611139,157,161129,378,0001,016,0002,113,536
5Aug 4, 2026 07:4026,618138,971,264129,425,0001,006,0002,113,536
6Aug 4, 2026 07:4026,625138,855,083129,193,0001,271,0002,113,536
7Aug 4, 2026 07:4026,680139,762,375129,687,0001,046,0002,113,536
8Aug 4, 2026 07:4026,701139,273,123129,585,0001,254,0002,113,536
9Aug 4, 2026 07:4026,865140,033,889130,631,0001,012,0002,113,536