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 25, 2026 04:17Victor MerckléVictor MerckléScore: 30,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 04:2130,773159,197,028148,758,0002,031,0002,117,632stderr
2Aug 25, 2026 04:2130,809159,321,000148,933,0002,034,0002,117,632stderr
3Aug 25, 2026 04:2130,814159,405,474148,912,0002,077,0002,117,632stderr
4Aug 25, 2026 04:2130,827159,526,245149,026,0002,027,0002,117,632stderr
5Aug 25, 2026 04:2130,836159,439,014149,044,0002,056,0002,117,632stderr
6Aug 25, 2026 04:2130,856159,850,525149,131,0002,066,0002,117,632stderr
7Aug 25, 2026 04:2130,914159,783,530149,354,0002,126,0002,117,632stderr
8Aug 25, 2026 04:2130,976160,143,308149,759,0002,026,0002,117,632stderr
9Aug 25, 2026 04:2131,364162,070,541151,503,0002,183,0002,117,632stderr