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 4, 2026 07:54Josu San MartinJosu San MartinScore: 26,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:5426,180136,736,429127,098,0001,188,0002,113,536
2Aug 4, 2026 07:5426,188137,346,995127,071,0001,255,0002,113,536
3Aug 4, 2026 07:5426,198137,584,561127,108,0001,267,0002,113,536
4Aug 4, 2026 07:5426,198137,428,224127,111,0001,263,0002,113,536
5Aug 4, 2026 07:5426,229137,639,047127,277,0001,248,0002,113,536
6Aug 4, 2026 07:5426,258137,756,736127,651,0001,016,0002,113,536
7Aug 4, 2026 07:5426,266137,764,019127,452,0001,255,0002,113,536
8Aug 4, 2026 07:5426,314137,360,509127,933,0001,010,0002,113,536
9Aug 4, 2026 07:5426,733139,389,862129,738,0001,256,0002,113,536