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 14:37Josu San MartinJosu San MartinScore: 25,358Success
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 14:3825,285132,187,303122,713,0001,188,0002,113,536
2Aug 4, 2026 14:3825,290132,406,747122,670,0001,254,0002,113,536
3Aug 4, 2026 14:3825,291132,505,002122,889,0001,039,0002,113,536
4Aug 4, 2026 14:3825,326132,507,377122,856,0001,245,0002,113,536
5Aug 4, 2026 14:3825,358132,648,134123,103,0001,153,0002,113,536
6Aug 4, 2026 14:3825,360132,738,865123,012,0001,256,0002,113,536
7Aug 4, 2026 14:3825,366132,855,687123,043,0001,253,0002,113,536
8Aug 4, 2026 14:3825,381132,761,276123,120,0001,248,0002,113,536
9Aug 4, 2026 14:3825,493133,371,447123,665,0001,254,0002,113,536