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 00:39Josu San MartinJosu San MartinScore: 27,337Success
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 00:4027,281142,043,847132,408,0001,271,0002,113,536
2Aug 4, 2026 00:4027,314142,898,267132,586,0001,257,0002,113,536
3Aug 4, 2026 00:4027,317142,918,346132,603,0001,254,0002,113,536
4Aug 4, 2026 00:4027,318142,965,330132,601,0001,259,0002,113,536
5Aug 4, 2026 00:4027,337143,126,056132,681,0001,275,0002,113,536
6Aug 4, 2026 00:4027,338142,408,795132,699,0001,262,0002,113,536
7Aug 4, 2026 00:4027,364143,131,571132,830,0001,254,0002,113,536
8Aug 4, 2026 00:4027,365143,206,164133,090,0001,002,0002,113,536
9Aug 4, 2026 00:4027,377142,547,265132,888,0001,262,0002,113,536