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:03Josu San MartinJosu San MartinScore: 26,643Success
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:0426,596138,479,762129,289,0001,032,0002,113,536
2Aug 4, 2026 07:0426,619138,927,033129,173,0001,261,0002,113,536
3Aug 4, 2026 07:0426,623138,922,920129,199,0001,258,0002,113,536
4Aug 4, 2026 07:0426,639139,016,544129,273,0001,261,0002,113,536
5Aug 4, 2026 07:0426,643138,983,544129,298,0001,256,0002,113,536
6Aug 4, 2026 07:0426,652139,087,384129,336,0001,262,0002,113,536
7Aug 4, 2026 07:0426,653139,050,820129,339,0001,264,0002,113,536
8Aug 4, 2026 07:0426,654139,014,551129,343,0001,263,0002,113,536
9Aug 4, 2026 07:0426,662138,841,892129,626,0001,019,0002,113,536