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 10:48Josu San MartinJosu San MartinScore: 26,104Success
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 10:4926,037135,993,554126,320,0001,262,0002,113,536
2Aug 4, 2026 10:4926,041135,991,939126,356,0001,246,0002,113,536
3Aug 4, 2026 10:4926,047136,008,286126,367,0001,264,0002,113,536
4Aug 4, 2026 10:4926,076136,150,849126,517,0001,260,0002,113,536
5Aug 4, 2026 10:4926,104136,781,707126,658,0001,253,0002,113,536
6Aug 4, 2026 10:4926,114136,972,781126,700,0001,262,0002,113,536
7Aug 4, 2026 10:4926,143137,076,291126,838,0001,265,0002,113,536
8Aug 4, 2026 10:4926,204137,500,846127,149,0001,252,0002,113,536
9Aug 4, 2026 10:4926,245137,071,026127,558,0001,044,0002,113,536