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:35Victor MerckléVictor MerckléScore: 28,607Success
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:3628,306147,053,561137,694,0001,010,0002,117,632stderr
2Aug 24, 2026 23:3628,310147,086,987136,711,0002,009,0002,117,632stderr
3Aug 24, 2026 23:3628,416147,619,351138,233,0001,009,0002,117,632stderr
4Aug 24, 2026 23:3628,574148,468,727139,004,0001,010,0002,117,632stderr
5Aug 24, 2026 23:3628,607148,642,855138,126,0002,051,0002,117,632stderr
6Aug 24, 2026 23:3628,631148,675,517138,285,0002,007,0002,117,632stderr
7Aug 24, 2026 23:3628,657148,848,496139,412,0001,009,0002,117,632stderr
8Aug 24, 2026 23:3628,704149,647,962138,630,0002,021,0002,117,632stderr
9Aug 24, 2026 23:3628,810149,529,634139,140,0002,033,0002,117,632stderr