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 5, 2026 14:46Josu San MartinJosu San MartinScore: 31,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 14:4730,955159,908,336150,430,0001,250,0002,113,536
2Aug 5, 2026 14:4730,963160,063,125150,476,0001,246,0002,113,536
3Aug 5, 2026 14:4731,005160,368,786150,675,0001,250,0002,113,536
4Aug 5, 2026 14:4731,053160,573,886150,983,0001,178,0002,113,536
5Aug 5, 2026 14:4731,100160,869,364151,112,0001,279,0002,113,536
6Aug 5, 2026 14:4731,195161,302,876151,606,0001,253,0002,113,536
7Aug 5, 2026 14:4731,283161,753,960152,277,0001,010,0002,113,536
8Aug 5, 2026 14:4731,284161,779,291152,030,0001,266,0002,113,536
9Aug 5, 2026 14:4731,295161,726,642152,089,0001,258,0002,113,536