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 18:37Victor MerckléVictor MerckléScore: 29,683Success
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 18:3829,560153,257,960142,807,0002,038,0002,117,632stderr
2Aug 24, 2026 18:3829,590153,356,248142,968,0002,023,0002,117,632stderr
3Aug 24, 2026 18:3829,643153,620,780144,244,0001,011,0002,117,632stderr
4Aug 24, 2026 18:3829,665153,764,808144,348,0001,011,0002,117,632stderr
5Aug 24, 2026 18:3829,683153,586,948144,438,0001,010,0002,117,632stderr
6Aug 24, 2026 18:3829,711154,041,703144,576,0001,010,0002,117,632stderr
7Aug 24, 2026 18:3829,759153,970,248144,813,0001,008,0002,117,632stderr
8Aug 24, 2026 18:3829,817154,547,386144,065,0002,040,0002,117,632stderr
9Aug 24, 2026 18:3831,448162,464,215152,057,0002,043,0002,117,632stderr