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 02:56Josu San MartinJosu San MartinScore: 27,153Success
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 02:5727,110141,949,817131,574,0001,267,0002,113,536
2Aug 4, 2026 02:5727,112141,258,164131,589,0001,260,0002,113,536
3Aug 4, 2026 02:5727,117142,845,131131,613,0001,262,0002,113,536
4Aug 4, 2026 02:5727,125141,330,257131,652,0001,262,0002,113,536
5Aug 4, 2026 02:5727,153141,581,228131,787,0001,263,0002,113,536
6Aug 4, 2026 02:5727,183142,309,302131,938,0001,262,0002,113,536
7Aug 4, 2026 02:5727,228142,586,404132,143,0001,277,0002,113,536
8Aug 4, 2026 02:5727,299142,222,380132,511,0001,256,0002,113,536
9Aug 4, 2026 02:5732,340167,033,075157,207,0001,263,0002,113,536