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 04:12Josu San MartinJosu San MartinScore: 29,018Success
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 04:1228,985150,502,267141,027,0001,003,0002,113,536
2Aug 3, 2026 04:1228,995150,533,820141,064,0001,015,0002,113,536
3Aug 3, 2026 04:1229,005150,552,135141,119,0001,006,0002,113,536
4Aug 3, 2026 04:1229,017151,282,952140,910,0001,278,0002,113,536
5Aug 3, 2026 04:1229,018151,244,523141,134,0001,059,0002,113,536
6Aug 3, 2026 04:1229,019150,368,059141,187,0001,007,0002,113,536
7Aug 3, 2026 04:1229,046151,436,312141,064,0001,262,0002,113,536
8Aug 3, 2026 04:1229,127151,144,582141,459,0001,264,0002,113,536
9Aug 3, 2026 04:1230,702158,942,736149,186,0001,254,0002,113,536