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:48Victor MerckléVictor MerckléScore: 28,043Success
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:4927,945145,303,883135,926,0001,009,0002,117,632stderr
2Aug 25, 2026 04:4927,957145,415,201134,976,0002,014,0002,117,632stderr
3Aug 25, 2026 04:4927,994145,558,505136,163,0001,010,0002,117,632stderr
4Aug 25, 2026 04:4928,005145,595,399135,202,0002,024,0002,117,632stderr
5Aug 25, 2026 04:4928,043145,778,028136,404,0001,010,0002,117,632stderr
6Aug 25, 2026 04:4928,044145,809,797136,409,0001,009,0002,117,632stderr
7Aug 25, 2026 04:4928,054145,814,184136,457,0001,009,0002,117,632stderr
8Aug 25, 2026 04:4928,075145,908,720136,558,0001,010,0002,117,632stderr
9Aug 25, 2026 04:4928,081146,012,590135,592,0002,005,0002,117,632stderr