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 19:19Victor MerckléVictor MerckléScore: 28,267Success
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 19:2027,986152,954,511135,088,0002,045,0002,117,632stderr
2Aug 24, 2026 19:2028,146146,414,007135,898,0002,020,0002,117,632stderr
3Aug 24, 2026 19:2028,168146,413,376136,015,0002,010,0002,117,632stderr
4Aug 24, 2026 19:2028,260146,965,814136,437,0002,038,0002,117,632stderr
5Aug 24, 2026 19:2028,267148,125,478137,499,0001,010,0002,117,632stderr
6Aug 24, 2026 19:2028,274146,970,401137,534,0001,009,0002,117,632stderr
7Aug 24, 2026 19:2028,289147,011,397137,609,0001,010,0002,117,632stderr
8Aug 24, 2026 19:2028,351147,280,049136,885,0002,039,0002,117,632stderr
9Aug 24, 2026 19:2028,387147,519,824137,090,0002,009,0002,117,632stderr