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 2, 2026 13:13anboto1anboto1Score: 113,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:14113,411565,999,346554,475,0001,241,0002,113,536
2Aug 2, 2026 13:14113,418565,864,575554,515,0001,238,0002,113,536
3Aug 2, 2026 13:14113,439565,989,150554,635,0001,219,0002,113,536
4Aug 2, 2026 13:14113,469566,778,947554,772,0001,229,0002,113,536
5Aug 2, 2026 13:14113,515566,586,497554,981,0001,247,0002,113,536
6Aug 2, 2026 13:14113,532566,469,164555,113,0001,198,0002,113,536
7Aug 2, 2026 13:14114,592571,611,909560,258,0001,245,0002,113,536
8Aug 2, 2026 13:14114,669571,963,315560,638,0001,243,0002,113,536
9Aug 2, 2026 13:14114,675571,980,672560,675,0001,233,0002,113,536