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 20:31anboto1anboto1Score: 57,742Success
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 20:3257,614291,303,905281,198,0001,113,0002,113,536
2Aug 3, 2026 20:3257,633291,476,608281,287,0001,115,0002,113,536
3Aug 3, 2026 20:3257,686291,710,327281,437,0001,226,0002,113,536
4Aug 3, 2026 20:3257,698291,824,155281,555,0001,168,0002,113,536
5Aug 3, 2026 20:3257,742292,102,048281,719,0001,221,0002,113,536
6Aug 3, 2026 20:3257,763291,508,490281,863,0001,178,0002,113,536
7Aug 3, 2026 20:3257,794291,763,550282,066,0001,129,0002,113,536
8Aug 3, 2026 20:3258,071293,922,296283,352,0001,197,0002,113,536
9Aug 3, 2026 20:3259,620301,223,699291,137,0001,002,0002,113,536