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 17:40Victor MerckléVictor MerckléScore: 28,779Success
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 17:4228,643148,737,253138,314,0002,039,0002,117,632stderr
2Aug 24, 2026 17:4228,718148,843,032138,673,0002,050,0002,117,632stderr
3Aug 24, 2026 17:4228,724149,157,017138,722,0002,030,0002,117,632stderr
4Aug 24, 2026 17:4228,735149,180,562138,787,0002,015,0002,117,632stderr
5Aug 24, 2026 17:4228,779149,413,228140,008,0001,010,0002,117,632stderr
6Aug 24, 2026 17:4228,801149,501,421139,032,0002,094,0002,117,632stderr
7Aug 24, 2026 17:4229,237151,593,680141,184,0002,078,0002,117,632stderr
8Aug 24, 2026 17:4229,381152,109,339141,961,0002,010,0002,117,632stderr
9Aug 24, 2026 17:4230,389157,070,124147,897,0001,011,0002,117,632stderr