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 29, 2026 03:26Josu San MartinJosu San MartinScore: 24,414Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:2624,402127,994,893118,560,0001,012,0002,113,536
2Aug 29, 2026 03:2624,405128,067,919118,574,0001,013,0002,113,536
3Aug 29, 2026 03:2624,413128,656,811118,614,0001,013,0002,113,536
4Aug 29, 2026 03:2624,414128,644,487118,619,0001,013,0002,113,536
5Aug 29, 2026 03:2624,414128,060,950118,620,0001,013,0002,113,536
6Aug 29, 2026 03:2624,535128,628,013119,208,0001,014,0002,113,536
7Aug 29, 2026 03:2624,537128,649,382119,226,0001,008,0002,113,536
8Aug 29, 2026 03:2624,768130,377,791120,357,0001,008,0002,113,536
9Aug 29, 2026 03:2626,649138,988,222129,575,0001,007,0002,113,536