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 15:40Victor MerckléVictor MerckléScore: 27,294Success
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 15:4127,255142,015,398132,533,0001,017,0002,117,632stderr
2Aug 25, 2026 15:4127,259141,997,247132,555,0001,016,0002,117,632stderr
3Aug 25, 2026 15:4127,270142,005,911132,537,0001,087,0002,117,632stderr
4Aug 25, 2026 15:4127,277142,124,078132,568,0001,091,0002,117,632stderr
5Aug 25, 2026 15:4127,294142,175,500132,633,0001,109,0002,117,632stderr
6Aug 25, 2026 15:4127,313142,303,133132,713,0001,122,0002,117,632stderr
7Aug 25, 2026 15:4127,333142,197,531132,664,0001,270,0002,117,632stderr
8Aug 25, 2026 15:4127,341142,229,336132,730,0001,242,0002,117,632stderr
9Aug 25, 2026 15:4127,356143,132,159132,938,0001,109,0002,117,632stderr