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:58Josu San MartinJosu San MartinScore: 28,575Success
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:5828,466147,893,600138,459,0001,028,0002,113,536
2Aug 3, 2026 22:5828,545151,332,832138,693,0001,179,0002,113,536
3Aug 3, 2026 22:5828,547149,598,045138,879,0001,002,0002,113,536
4Aug 3, 2026 22:5828,557148,168,078138,851,0001,080,0002,113,536
5Aug 3, 2026 22:5828,575148,375,171138,832,0001,187,0002,113,536
6Aug 3, 2026 22:5828,595148,584,369138,872,0001,247,0002,113,536
7Aug 3, 2026 22:5828,597148,551,627138,929,0001,200,0002,113,536
8Aug 3, 2026 22:5828,643148,694,903139,164,0001,188,0002,113,536
9Aug 3, 2026 22:5828,993152,440,286141,059,0001,010,0002,113,536