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 22:03Victor MerckléVictor MerckléScore: 29,375Success
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 22:0429,236153,004,442141,159,0002,100,0002,117,632stderr
2Aug 24, 2026 22:0429,271152,664,936141,415,0002,014,0002,117,632stderr
3Aug 24, 2026 22:0429,295152,347,354142,540,0001,009,0002,117,632stderr
4Aug 24, 2026 22:0429,373152,390,060142,920,0001,010,0002,117,632stderr
5Aug 24, 2026 22:0429,375152,357,555142,927,0001,011,0002,117,632stderr
6Aug 24, 2026 22:0429,376152,338,433141,932,0002,014,0002,117,632stderr
7Aug 24, 2026 22:0429,420152,502,022142,114,0002,046,0002,117,632stderr
8Aug 24, 2026 22:0429,421152,664,362142,137,0002,026,0002,117,632stderr
9Aug 24, 2026 22:0429,565153,245,758142,858,0002,012,0002,117,632stderr