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 04:36anboto1anboto1Score: 58,978Success
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 04:3758,758298,539,652286,808,0001,109,0002,113,536
2Aug 3, 2026 04:3758,810299,031,740287,049,0001,120,0002,113,536
3Aug 3, 2026 04:3758,823299,091,864286,968,0001,268,0002,113,536
4Aug 3, 2026 04:3758,841298,382,642287,195,0001,130,0002,113,536
5Aug 3, 2026 04:3758,978299,860,611287,870,0001,124,0002,113,536
6Aug 3, 2026 04:3759,013299,308,035288,049,0001,116,0002,113,536
7Aug 3, 2026 04:3759,034299,383,059288,147,0001,121,0002,113,536
8Aug 3, 2026 04:3759,042299,522,514288,186,0001,120,0002,113,536
9Aug 3, 2026 04:3759,678303,187,375291,295,0001,128,0002,113,536