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:40Josu San MartinJosu San MartinScore: 32,817Success
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:4132,791171,436,103159,530,0001,146,0002,113,536
2Aug 2, 2026 19:4132,799170,760,903159,611,0001,107,0002,113,536
3Aug 2, 2026 19:4132,807170,755,453159,638,0001,119,0002,113,536
4Aug 2, 2026 19:4132,808171,553,080159,632,0001,132,0002,113,536
5Aug 2, 2026 19:4132,817170,935,954159,676,0001,131,0002,113,536
6Aug 2, 2026 19:4132,818171,062,816159,694,0001,119,0002,113,536
7Aug 2, 2026 19:4132,828170,905,614159,533,0001,325,0002,113,536
8Aug 2, 2026 19:4132,843170,957,424159,823,0001,110,0002,113,536
9Aug 2, 2026 19:4133,279173,098,525161,943,0001,125,0002,113,536