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:08Josu San MartinJosu San MartinScore: 27,275Success
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:0927,253142,042,299132,528,0001,016,0002,113,536
2Aug 4, 2026 02:0927,253142,609,269132,272,0001,271,0002,113,536
3Aug 4, 2026 02:0927,265142,642,421132,341,0001,261,0002,113,536
4Aug 4, 2026 02:0927,269142,672,670132,361,0001,258,0002,113,536
5Aug 4, 2026 02:0927,275142,163,501132,395,0001,257,0002,113,536
6Aug 4, 2026 02:0927,275142,145,529132,636,0001,015,0002,113,536
7Aug 4, 2026 02:0927,283141,866,110132,672,0001,019,0002,113,536
8Aug 4, 2026 02:0927,300142,817,336132,519,0001,253,0002,113,536
9Aug 4, 2026 02:0927,472143,722,343133,612,0001,002,0002,113,536