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 21:02Victor MerckléVictor MerckléScore: 28,428Success
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 21:0228,254146,826,513136,420,0002,026,0002,117,632stderr
2Aug 24, 2026 21:0228,280147,000,864136,560,0002,015,0002,117,632stderr
3Aug 24, 2026 21:0228,324147,304,769136,745,0002,044,0002,117,632stderr
4Aug 24, 2026 21:0228,346147,254,303137,886,0001,010,0002,117,632stderr
5Aug 24, 2026 21:0228,428147,739,416137,291,0002,010,0002,117,632stderr
6Aug 24, 2026 21:0228,523148,135,106138,755,0001,008,0002,117,632stderr
7Aug 24, 2026 21:0228,533148,318,863137,808,0002,007,0002,117,632stderr
8Aug 24, 2026 21:0228,684148,902,749138,510,0002,044,0002,117,632stderr
9Aug 24, 2026 21:0228,871149,865,719140,462,0001,010,0002,117,632stderr