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 29, 2026 01:34Josu San MartinJosu San MartinScore: 24,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:3524,396127,953,164118,292,0001,250,0002,113,536
2Aug 29, 2026 01:3524,401128,523,735118,325,0001,244,0002,113,536
3Aug 29, 2026 01:3524,403127,974,625118,320,0001,256,0002,113,536
4Aug 29, 2026 01:3524,407128,582,771118,326,0001,270,0002,113,536
5Aug 29, 2026 01:3524,410128,721,651118,352,0001,259,0002,113,536
6Aug 29, 2026 01:3524,414128,568,059118,377,0001,254,0002,113,536
7Aug 29, 2026 01:3524,452128,772,641118,556,0001,263,0002,113,536
8Aug 29, 2026 01:3524,463128,057,857118,863,0001,010,0002,113,536
9Aug 29, 2026 01:3525,060131,196,119121,553,0001,244,0002,113,536