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 28, 2026 18:44flavio87flavio87Score: 26,428Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 18:4426,413137,797,443128,301,0001,125,0002,113,536
2Aug 28, 2026 18:4426,414137,774,345128,328,0001,102,0002,113,536
3Aug 28, 2026 18:4426,423137,920,166128,366,0001,107,0002,113,536
4Aug 28, 2026 18:4426,425137,851,841128,385,0001,099,0002,113,536
5Aug 28, 2026 18:4426,428137,838,816128,399,0001,101,0002,113,536
6Aug 28, 2026 18:4426,434137,927,585128,425,0001,105,0002,113,536
7Aug 28, 2026 18:4426,508138,293,004128,759,0001,135,0002,113,536
8Aug 28, 2026 18:4427,796144,542,722135,175,0001,026,0002,113,536
9Aug 28, 2026 18:4427,806144,609,664135,222,0001,031,0002,113,536