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 3, 2026 07:33Josu San MartinJosu San MartinScore: 29,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 07:3429,386152,185,666142,932,0001,062,0002,113,536
2Aug 3, 2026 07:3429,394153,926,434142,983,0001,049,0002,113,536
3Aug 3, 2026 07:3429,402152,532,734143,056,0001,014,0002,113,536
4Aug 3, 2026 07:3429,406152,646,492142,842,0001,250,0002,113,536
5Aug 3, 2026 07:3429,426153,290,059142,922,0001,267,0002,113,536
6Aug 3, 2026 07:3429,427152,586,335142,930,0001,264,0002,113,536
7Aug 3, 2026 07:3429,525153,701,424143,399,0001,276,0002,113,536
8Aug 3, 2026 07:3429,767154,300,929144,599,0001,263,0002,113,536
9Aug 3, 2026 07:3439,208201,438,509190,859,0001,264,0002,113,536