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 16:49Josu San MartinJosu San MartinScore: 25,797Success
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 16:4925,724135,039,477124,803,0001,248,0002,113,536
2Aug 4, 2026 16:4925,768134,646,087125,005,0001,263,0002,113,536
3Aug 4, 2026 16:4925,773135,298,846125,024,0001,267,0002,113,536
4Aug 4, 2026 16:4925,774135,326,764125,036,0001,260,0002,113,536
5Aug 4, 2026 16:4925,797134,711,564125,153,0001,253,0002,113,536
6Aug 4, 2026 16:4925,809135,510,642125,207,0001,260,0002,113,536
7Aug 4, 2026 16:4925,834135,672,428125,347,0001,242,0002,113,536
8Aug 4, 2026 16:4925,845135,081,364125,381,0001,262,0002,113,536
9Aug 4, 2026 16:4925,922135,998,106125,768,0001,254,0002,113,536