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 18:37Josu San MartinJosu San MartinScore: 27,602Success
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 18:3827,590143,291,593133,927,0001,268,0002,113,536
2Aug 3, 2026 18:3827,594143,435,242133,942,0001,273,0002,113,536
3Aug 3, 2026 18:3827,597143,355,556134,199,0001,031,0002,113,536
4Aug 3, 2026 18:3827,600143,544,722133,966,0001,274,0002,113,536
5Aug 3, 2026 18:3827,602143,395,615133,978,0001,275,0002,113,536
6Aug 3, 2026 18:3827,613143,510,226134,033,0001,275,0002,113,536
7Aug 3, 2026 18:3827,668143,728,927134,571,0001,006,0002,113,536
8Aug 3, 2026 18:3827,784144,392,542135,133,0001,012,0002,113,536
9Aug 3, 2026 18:3827,875144,788,235135,326,0001,265,0002,113,536