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:34Victor MerckléVictor MerckléScore: 29,360Success
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:3629,239151,660,844142,265,0001,009,0002,117,632stderr
2Aug 24, 2026 19:3629,248152,212,671141,259,0002,057,0002,117,632stderr
3Aug 24, 2026 19:3629,262151,770,135142,378,0001,010,0002,117,632stderr
4Aug 24, 2026 19:3629,293151,867,748142,529,0001,009,0002,117,632stderr
5Aug 24, 2026 19:3629,360152,237,510142,855,0001,011,0002,117,632stderr
6Aug 24, 2026 19:3629,563153,249,870143,852,0001,010,0002,117,632stderr
7Aug 24, 2026 19:3629,629153,584,517143,139,0002,045,0002,117,632stderr
8Aug 24, 2026 19:3629,630153,606,947144,176,0001,012,0002,117,632stderr
9Aug 24, 2026 19:3629,711153,966,340143,579,0002,006,0002,117,632stderr