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 12:33Josu San MartinJosu San MartinScore: 25,451Success
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 12:3325,406133,471,961123,219,0001,274,0002,113,536
2Aug 4, 2026 12:3325,447133,810,912123,444,0001,250,0002,113,536
3Aug 4, 2026 12:3325,448133,859,765123,438,0001,261,0002,113,536
4Aug 4, 2026 12:3325,450133,700,170123,446,0001,263,0002,113,536
5Aug 4, 2026 12:3325,451133,848,860123,459,0001,254,0002,113,536
6Aug 4, 2026 12:3325,457133,747,102123,491,0001,249,0002,113,536
7Aug 4, 2026 12:3325,481133,956,800123,604,0001,253,0002,113,536
8Aug 4, 2026 12:3325,666134,854,208124,505,0001,262,0002,113,536
9Aug 4, 2026 12:3325,860135,722,196125,450,0001,264,0002,113,536