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 3, 2026 21:39anboto1anboto1Score: 57,587Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:4057,519290,293,628280,710,0001,136,0002,113,536
2Aug 3, 2026 21:4057,525290,972,646280,784,0001,089,0002,113,536
3Aug 3, 2026 21:4057,585291,330,823281,151,0001,018,0002,113,536
4Aug 3, 2026 21:4057,585291,328,312281,064,0001,106,0002,113,536
5Aug 3, 2026 21:4057,587291,289,040281,082,0001,097,0002,113,536
6Aug 3, 2026 21:4057,618291,454,195281,245,0001,088,0002,113,536
7Aug 3, 2026 21:4057,630290,820,029281,304,0001,087,0002,113,536
8Aug 3, 2026 21:4057,637290,570,679281,325,0001,097,0002,113,536
9Aug 3, 2026 21:4059,054297,786,392288,271,0001,096,0002,113,536