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 28, 2026 22:04Josu San MartinJosu San MartinScore: 25,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 22:0525,021131,697,574121,344,0001,261,0002,113,536
2Aug 28, 2026 22:0525,029131,174,277121,389,0001,256,0002,113,536
3Aug 28, 2026 22:0525,030131,158,091121,402,0001,248,0002,113,536
4Aug 28, 2026 22:0525,033131,047,420121,410,0001,256,0002,113,536
5Aug 28, 2026 22:0525,035131,138,242121,412,0001,263,0002,113,536
6Aug 28, 2026 22:0525,063131,843,229121,793,0001,016,0002,113,536
7Aug 28, 2026 22:0525,065131,188,869121,560,0001,260,0002,113,536
8Aug 28, 2026 22:0525,092131,268,762121,713,0001,240,0002,113,536
9Aug 28, 2026 22:0525,415132,881,993123,275,0001,260,0002,113,536