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 24, 2026 23:25Victor MerckléVictor MerckléScore: 112,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 23:25112,430560,540,461548,900,0002,011,0002,117,632stderr
2Aug 24, 2026 23:25112,454559,422,375549,000,0002,028,0002,117,632stderr
3Aug 24, 2026 23:25112,463559,477,053549,026,0002,043,0002,117,632stderr
4Aug 24, 2026 23:25112,479559,642,281548,951,0002,199,0002,117,632stderr
5Aug 24, 2026 23:25112,504560,331,885549,097,0002,177,0002,117,632stderr
6Aug 24, 2026 23:25112,511559,740,488549,183,0002,125,0002,117,632stderr
7Aug 24, 2026 23:25112,512559,873,170549,143,0002,167,0002,117,632stderr
8Aug 24, 2026 23:25112,524559,827,139549,274,0002,095,0002,117,632stderr
9Aug 24, 2026 23:25112,527559,827,979549,294,0002,089,0002,117,632stderr