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 3, 2026 22:33Josu San MartinJosu San MartinScore: 29,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 22:3329,374152,377,967142,671,0001,263,0002,113,536
2Aug 3, 2026 22:3329,413152,491,025142,949,0001,175,0002,113,536
3Aug 3, 2026 22:3329,417152,353,758143,145,0001,003,0002,113,536
4Aug 3, 2026 22:3329,417152,302,593143,113,0001,031,0002,113,536
5Aug 3, 2026 22:3329,431152,680,062142,946,0001,268,0002,113,536
6Aug 3, 2026 22:3329,455157,879,499143,294,0001,038,0002,113,536
7Aug 3, 2026 22:3329,458152,741,986143,064,0001,281,0002,113,536
8Aug 3, 2026 22:3330,755159,240,492149,612,0001,090,0002,113,536
9Aug 3, 2026 22:3332,865170,099,236159,787,0001,255,0002,113,536