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 2, 2026 19:29Josu San MartinJosu San MartinScore: 32,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 19:3032,914171,300,157160,156,0001,124,0002,113,536
2Aug 2, 2026 19:3032,917171,295,078160,178,0001,118,0002,113,536
3Aug 2, 2026 19:3032,924171,426,320160,206,0001,124,0002,113,536
4Aug 2, 2026 19:3032,929172,017,157160,217,0001,136,0002,113,536
5Aug 2, 2026 19:3032,939172,736,678160,263,0001,140,0002,113,536
6Aug 2, 2026 19:3032,946172,155,399160,330,0001,109,0002,113,536
7Aug 2, 2026 19:3032,950171,512,823160,335,0001,123,0002,113,536
8Aug 2, 2026 19:3032,951171,474,588160,341,0001,120,0002,113,536
9Aug 2, 2026 19:3033,173173,360,086161,345,0001,206,0002,113,536