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 29, 2026 01:23Josu San MartinJosu San MartinScore: 24,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:2324,214127,034,823117,400,0001,253,0002,113,536
2Aug 29, 2026 01:2324,214127,009,231117,402,0001,249,0002,113,536
3Aug 29, 2026 01:2324,217127,066,557117,426,0001,240,0002,113,536
4Aug 29, 2026 01:2324,245127,189,170117,655,0001,146,0002,113,536
5Aug 29, 2026 01:2324,251127,227,181117,649,0001,184,0002,113,536
6Aug 29, 2026 01:2324,256127,309,396117,682,0001,176,0002,113,536
7Aug 29, 2026 01:2324,265127,258,031117,716,0001,186,0002,113,536
8Aug 29, 2026 01:2324,487128,374,201118,748,0001,239,0002,113,536
9Aug 29, 2026 01:2324,525128,631,480118,917,0001,260,0002,113,536