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 21:36Josu San MartinJosu San MartinScore: 36,850Success
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 21:3736,251185,792,114176,617,0001,014,0002,113,536
2Aug 3, 2026 21:3736,327187,101,712176,826,0001,181,0002,113,536
3Aug 3, 2026 21:3736,468187,170,149177,501,0001,197,0002,113,536
4Aug 3, 2026 21:3736,786189,312,661179,253,0001,003,0002,113,536
5Aug 3, 2026 21:3736,850189,225,353179,372,0001,193,0002,113,536
6Aug 3, 2026 21:3736,934189,725,666179,777,0001,204,0002,113,536
7Aug 3, 2026 21:3736,942189,428,457180,014,0001,004,0002,113,536
8Aug 3, 2026 21:3736,955189,388,092179,885,0001,198,0002,113,536
9Aug 3, 2026 21:3737,052190,577,438180,359,0001,198,0002,113,536