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 10:52Josu San MartinJosu San MartinScore: 26,178Success
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 10:5226,058136,204,255126,412,0001,273,0002,113,536
2Aug 4, 2026 10:5226,125137,100,414127,009,0001,008,0002,113,536
3Aug 4, 2026 10:5226,146136,480,678126,855,0001,262,0002,113,536
4Aug 4, 2026 10:5226,164136,644,944126,942,0001,264,0002,113,536
5Aug 4, 2026 10:5226,178137,343,146127,243,0001,032,0002,113,536
6Aug 4, 2026 10:5226,189137,355,189127,075,0001,253,0002,113,536
7Aug 4, 2026 10:5226,305137,344,071127,627,0001,269,0002,113,536
8Aug 4, 2026 10:5226,340137,406,684127,807,0001,263,0002,113,536
9Aug 4, 2026 10:5226,427139,303,713128,482,0001,015,0002,113,536