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 01:44Josu San MartinJosu San MartinScore: 29,771Success
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 01:4429,746154,746,327144,495,0001,262,0002,113,536
2Aug 4, 2026 01:4429,753154,187,235144,533,0001,261,0002,113,536
3Aug 4, 2026 01:4429,764154,338,460144,579,0001,269,0002,113,536
4Aug 4, 2026 01:4429,767154,892,052144,792,0001,069,0002,113,536
5Aug 4, 2026 01:4429,771155,042,068144,874,0001,008,0002,113,536
6Aug 4, 2026 01:4429,805154,506,880144,787,0001,262,0002,113,536
7Aug 4, 2026 01:4429,982155,341,026145,650,0001,266,0002,113,536
8Aug 4, 2026 01:4429,993155,404,226145,696,0001,270,0002,113,536
9Aug 4, 2026 01:4436,258186,819,825176,411,0001,257,0002,113,536