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 15:01Josu San MartinJosu San MartinScore: 36,793Success
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 15:0236,732190,748,813178,862,0001,125,0002,113,536
2Aug 2, 2026 15:0236,735190,797,068178,879,0001,127,0002,113,536
3Aug 2, 2026 15:0236,767190,623,503179,039,0001,123,0002,113,536
4Aug 2, 2026 15:0236,791190,340,914179,154,0001,122,0002,113,536
5Aug 2, 2026 15:0236,793190,348,413179,164,0001,123,0002,113,536
6Aug 2, 2026 15:0236,804190,428,225179,215,0001,125,0002,113,536
7Aug 2, 2026 15:0236,817191,123,517179,275,0001,133,0002,113,536
8Aug 2, 2026 15:0237,029191,513,481180,327,0001,116,0002,113,536
9Aug 2, 2026 15:0237,130192,600,604180,809,0001,130,0002,113,536