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 01:16Victor MerckléVictor MerckléScore: 28,926Success
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 01:1628,846149,705,999139,331,0002,016,0002,117,632stderr
2Aug 25, 2026 01:1628,896150,025,679139,586,0002,006,0002,117,632stderr
3Aug 25, 2026 01:1628,898150,022,150139,596,0002,005,0002,117,632stderr
4Aug 25, 2026 01:1628,909150,053,248139,652,0002,006,0002,117,632stderr
5Aug 25, 2026 01:1628,926150,185,036139,643,0002,098,0002,117,632stderr
6Aug 25, 2026 01:1628,961150,869,868139,886,0002,026,0002,117,632stderr
7Aug 25, 2026 01:1629,003150,515,822140,104,0002,011,0002,117,632stderr
8Aug 25, 2026 01:1629,020150,583,959141,192,0001,010,0002,117,632stderr
9Aug 25, 2026 01:1629,066151,509,759140,393,0002,033,0002,117,632stderr