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 listJul 31, 2026 15:00Josu San MartinJosu San MartinScore: 61,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 15:0061,547311,877,095299,546,0002,036,0002,113,536
2Jul 31, 2026 15:0061,548312,348,484299,314,0002,274,0002,113,536
3Jul 31, 2026 15:0061,581312,595,578299,497,0002,251,0002,113,536
4Jul 31, 2026 15:0061,603312,875,227299,788,0002,070,0002,113,536
5Jul 31, 2026 15:0061,836313,281,406300,943,0002,057,0002,113,536
6Jul 31, 2026 15:0061,862313,446,893300,850,0002,276,0002,113,536
7Jul 31, 2026 15:0061,870313,344,693300,896,0002,270,0002,113,536
8Jul 31, 2026 15:0061,993313,870,052301,506,0002,260,0002,113,536
9Jul 31, 2026 15:0062,142315,405,064302,262,0002,234,0002,113,536