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 16:43Josu San MartinJosu San MartinScore: 28,038Success
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 16:4328,007146,663,151135,969,0001,266,0002,113,536
2Aug 3, 2026 16:4328,008146,298,072135,976,0001,265,0002,113,536
3Aug 3, 2026 16:4328,015146,365,806136,000,0001,276,0002,113,536
4Aug 3, 2026 16:4328,018146,390,669136,027,0001,262,0002,113,536
5Aug 3, 2026 16:4328,038146,475,736136,127,0001,264,0002,113,536
6Aug 3, 2026 16:4328,046146,552,227136,162,0001,265,0002,113,536
7Aug 3, 2026 16:4328,049146,560,657136,170,0001,272,0002,113,536
8Aug 3, 2026 16:4328,156147,079,400136,695,0001,270,0002,113,536
9Aug 3, 2026 16:4328,196147,970,466137,160,0001,003,0002,113,536