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 17:27Josu San MartinJosu San MartinScore: 27,487Success
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 17:2827,444142,939,208133,228,0001,252,0002,113,536
2Aug 3, 2026 17:2827,449143,579,435133,243,0001,259,0002,113,536
3Aug 3, 2026 17:2827,477143,691,100133,531,0001,110,0002,113,536
4Aug 3, 2026 17:2827,481143,751,946133,403,0001,257,0002,113,536
5Aug 3, 2026 17:2827,487145,194,545133,649,0001,042,0002,113,536
6Aug 3, 2026 17:2827,529143,260,485133,620,0001,275,0002,113,536
7Aug 3, 2026 17:2827,677144,713,274134,357,0001,263,0002,113,536
8Aug 3, 2026 17:2827,685143,804,911134,406,0001,255,0002,113,536
9Aug 3, 2026 17:2827,719145,336,436134,552,0001,274,0002,113,536